Matching nuts and bolts in O(n log n) time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 232-241

  Komlós, János ^a   Ma, Yuan ^b   Szemexédi, Endre ^c  

^a RUTGERS UNIVERSITY   (United States)

^b Stanford University   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOLTS; TREES (MATHEMATICS);

CONSTANT FACTORS; DETERMINISTIC ALGORITHMS; PARALLEL COMPARISONS; SORTING ALGORITHM; TREE MODELING;

FASTENERS;

EID: 84878932614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. M. Ajtai, J. Komlós, W. L. Steiger, and E. Szemerédi. Optimal parallel selection has complexity O(log log N). Journal of Computer and System Sciences, 38(1):125-133, 1989. The conference version appears in Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, pages 188-195, 1986.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clogn parallel steps. Combinatorica, 3(1):1-19, 1983. See also the conference version, which appears in Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pages 1-9, May 1983.
3. N. Alon, M. Blum, A. Fiat, S. Kannan, M. Naor, and R. Ostrovsky. Matching nuts and bolts. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 690-696, January 1994.
4. Y. Aumann. Personal communication. 1994.
5. M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448-461, 1973.
6. P. Bradford and R. Fleischer. Matching nuts and bolts faster. Technical Report MPI-I-95-1-003, Max-Planck-Institut Für Informatik, May 1995. An updated version appears in Proceedings of the Sixth International Symposium on Algorithms and Computation (ISAAC '95).
7. M. S. Paterson. Improved sorting networks with O(log N) depth. Algorithmica, 5:75-92, 1990.
8. G. J. E. Rawlins. Compared to what? an introduction to the analysis of algorithms. Computer Science Press, 1991.
9. L. G. Valiant. Parallelism in comparison problems. SIAM J. Comput., 4:348-355, 1975.