Article

Free access

Deterministic selection in O(loglog N) parallel time

Authors:

M Ajtai,

J Komlos,

W L Steiger,

E SzemerediAuthors Info & Claims

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

Pages 188 - 195

https://doi.org/10.1145/12130.12149

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

Ajtai, M., Koml6s, J., Steiger, W., and Szemer6di, E. Almost Sorting in One Round. Rutgers University, 1986.

Google Scholar

[2]

Ajtai, M., Koml6s, J., and Szemer~di, E. An O(nlogn) Sorting Network. Proc. 15 th ACM Symp. on Theory of Computing, ACM, 1983, pp. 1-9.

Digital Library

Google Scholar

[3]

Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., and Tarjan, R.E. "Time Bounds for Selection". JCSS 7 (1973), 448-461.

Digital Library

Google Scholar

[4]

Borodin, A. and Hopcroft, J.E. Routing, Merging, and Sorting on Parallel Models of Computation. Proc. 14 th ACM Symp. on Theory of Computing, ACM, 1982, pp. 338-344.

Digital Library

Google Scholar

[5]

Cole, Richard and Yap, Chee K. "A Parallel Median Algorithm". In{. Proc. Letters 20 (1985), 137-139.

Crossref

Google Scholar

[6]

Gaber, O. and Galil, Z. "Explicit Construction of Linear Sized Superconcentrators". J. Comp. and Sys. Sci. 22 (1981), 407-420.

Crossref

Google Scholar

[7]

Ger~b-Graus, Mih~ily and Krizanc, Danny. A Lower Bound of 12(loglogn) for Randomized Parallel Merging (draft). Harvard University, 1985.

Google Scholar

[8]

Reischuk, R. A Fast Probabilistic Sorting Algorithm. Proc. 22 nd FOCS Conf., IEEE, 1981, pp. 212-219.

Google Scholar

[9]

Valiant, L. "Parallelism in Comparison Problems". SIAM J. Computing (1975), 348-355.

Crossref

Google Scholar

Cited By

View all

Mazumdar ASaha B(2017)Query complexity of clustering with side informationProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3294996.3295221(4685-4696)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.5555/3294996.3295221
Braverman MMao JWeinberg SWichs DMansour Y(2016)Parallel algorithms for select and partition with noisy comparisonsProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897642(851-862)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897642
Rajasekaran S(2005)Randomized parallel selectionFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-53487-3_46(215-224)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-53487-3_46
Show More Cited By

Index Terms

Deterministic selection in O(loglog N) parallel time

Recommendations

Deterministic distributed vertex coloring in polylogarithmic time
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Consider an n-vertex graph G = (V,E) of maximum degree Δ, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it proceeds in discrete ...
Optimal parallel selection

We present an optimal parallel selection algorithm on the EREW PRAM. This algorithm runs in O(log n) time with n/log n processors. This complexity matches the known lower bound for parallel selection on the EREW PRAM model. We therefore close this ...
Deterministic Distributed Vertex Coloring in Polylogarithmic Time

Consider an n-vertex graph G = (V, E) of maximum degree Δ, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, that is, it proceeds in discrete ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

November 1986

461 pages

ISBN:0897911938

DOI:10.1145/12130

Chairman:
Juris Hartmanis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC86

Sponsor:

SIGACT

STOC86: Eighteenth Annaul ACM Symposium on Theory of Computing

May 28 - 30, 1986

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
539
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)4

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mazumdar ASaha B(2017)Query complexity of clustering with side informationProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3294996.3295221(4685-4696)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.5555/3294996.3295221
Braverman MMao JWeinberg SWichs DMansour Y(2016)Parallel algorithms for select and partition with noisy comparisonsProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897642(851-862)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897642
Rajasekaran S(2005)Randomized parallel selectionFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-53487-3_46(215-224)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-53487-3_46
Fujiwara TIwama KIwamoto C(2004)Partially effective randomization in simulations between arbitrary and common PRAMsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2003.12.00164:3(319-326)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1016/j.jpdc.2003.12.001
Al-furiah IAluru SGoil SRanka S(1997)Practical Algorithms for Selection on Coarse-Grained Parallel ComputersIEEE Transactions on Parallel and Distributed Systems10.1109/71.6057688:8(813-824)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1109/71.605768
Al-Furaih IAluru SGoil SRanka S(1996)Practical Algorithms for Selection on Coarse-Grained Parallel ComputersProceedings of the 10th International Parallel Processing Symposium10.5555/645606.661022(309-313)Online publication date: 15-Apr-1996
https://dl.acm.org/doi/10.5555/645606.661022
Dyer MSnoeyink J(1995)A parallel algorithm for linear programming in fixed dimensionProceedings of the eleventh annual symposium on Computational geometry10.1145/220279.220316(345-349)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1145/220279.220316
Alon NAzar YFrederickson G(1992)Comparison-sorting and selecting in totally monotone matricesProceedings of the third annual ACM-SIAM symposium on Discrete algorithms10.5555/139404.139484(403-408)Online publication date: 1-Sep-1992
https://dl.acm.org/doi/10.5555/139404.139484
Schwartz JSharir M(1992)Finding effective “force targets” for two-dimensional, multifinger frictional gripsAlgorithmica10.1007/BF017588338:1-6(1-20)Online publication date: 1-Dec-1992
https://dl.acm.org/doi/10.1007/BF01758833
Ranka SSahni S(1991)Efficient serial and parallel algorithms for median filteringIEEE Transactions on Signal Processing10.1109/78.13656139:6(1462-1466)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1109/78.136561
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Deterministic distributed vertex coloring in polylogarithmic time

Optimal parallel selection

Deterministic Distributed Vertex Coloring in Polylogarithmic Time