Selecting the k largest elements with parity tests

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 187-196

  Lam, Tak Wah ^a   Ting, Hing Fung ^a  

^a INNER MONGOLIA UNIVERSITY   (China)

Author keywords

Lower bound; Parity tests; Randomized algorithm; Selection

Indexed keywords

EID: 0347304330     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00193-6     Document Type: Article

References (11)

1. R. Fleischer, Decision trees: old and new results, Proceedings of the 25th Annual ACM Symposium on Theory on Computing, 1993, pp. 468-477.
2. Fussenegger F., Gabow H.N. A counting approach to lower bounds for selection problems. J. Assoc. Comput. Mach. 26:1979;227-238.
3. Gasarch W.I. On selecting the. k largest with restricted quadratic queries Inform. Process. Lett. 38:1991;193-195.
4. Hyafil L. Bounds for selection. SIAM J. Comput. 5:1976;109-114.
5. Kirkpatrick D. A unified lower bound for selection and set partitioning problems. J. Assoc. Comput. Mach. 28:1981;150-165.
6. Kislitsyn S.S. On the selection of the. k -th element of an ordered set by pairwise comparisons Sibirskii Mat. Zhurnal. 5:1964;557-564.
7. V. Pratt, F. Yao, On lower bounds for computing the i th largest element, Proceedings of 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 70-81.
8. E. Reingold, Computing the maxima and the median, Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory, 1971, pp. 216-218.
9. 2) polynomial tests Inform. Process. Lett. 49:1994;39-43.
10. A.C. Yao, Probabilistic computations: Towards a unified measure of complexity, Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1977, pp. 222-227.
11. Yao A.C. On selecting the. k largest with median tests Algorithmica. 4:1989;293-299.