Sorting in c log n parallel steps
Combinatorica
Optimal parallel selection had complexity O(log log N)
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Matching Nuts and Bolts Faster
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Selection with monotone comparison costs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |