A randomized algorithm for finding maximum with O((log n)2) polynomial tests

Authors:
Hing F. Ting;Andrew C. Yao
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 2

Selecting the k Largest Elements with Parity Tests

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized Complexity of Linear Arrangements and Polyhedra

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract