N. Alon, P. G. Bradford, and R. Fleischer. Matching nuts and bolts faster. Inform. Process. Lett., 59(3):123--127, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Randomized Algorithms - A short course on and the probabilistic.. - Merkle (2001) (Correct)
....26 for Algorithm Quicksort. An argument similar to the one used in connection with the general sorting problem shows that any deterministic algorithm that solves the sorting nuts and bolts problem uses at least c(n log n) comparisons in worst case for some constant c 0. Bradford and Fleischer [7] give an deterministic algorithm that uses O(n log 2 n) comparisons in worst case, thus improving on a previous algorithm due to Alon et. al [2] that uses O(n log 4 n) comparisons. K oml os, Ma, and Szemer edi [21] describe an algorithm that uses just O(n log n) comparisons, however, they ....
Phillip G. Bradford and Rudolf Fleischer. Matching nuts and bolts faster. In ISAAC 1995, volume 1004 of Lecture Notes in Computer Science, pages 402-408, 1995.
Sorting and Selection with Structured Costs - Gupta, Kumar (2001) (1 citation) (Correct)
No context found.
N. Alon, P. G. Bradford, and R. Fleischer. Matching nuts and bolts faster. Inform. Process. Lett., 59(3):123--127, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC