Optimal Randomized Algorithms for Local Sorting and Set-Maxima
- 1 April 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (2) , 272-283
- https://doi.org/10.1137/0222020
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Acyclic orientations of graphsPublished by Elsevier ,2002
- A Linear Time Approach to the Set Maxima ProblemSIAM Journal on Discrete Mathematics, 1992
- Legal coloring of graphsCombinatorica, 1986
- Linear verification for spanning treesCombinatorica, 1985
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring ProblemSIAM Journal on Computing, 1984
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980