Randomized range-maxima in nearly-constant parallel time
- 1 December 1992
- journal article
- Published by Springer Nature in computational complexity
- Vol. 2 (4) , 350-373
- https://doi.org/10.1007/bf01200429
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- The average-case parallel complexity of sortingInformation Processing Letters, 1989
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting AlgorithmsSIAM Journal on Computing, 1988
- Tight Comparison Bounds on the Complexity of Parallel SortingSIAM Journal on Computing, 1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Probabilistic Parallel Algorithms for Sorting and SelectionSIAM Journal on Computing, 1985
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952