Selecting the k Largest Elements with Parity Tests
暂无分享,去创建一个
[1] Harold N. Gabow,et al. Using computer trees to derive lower bounds for selection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[2] David G. Kirkpatrick. A Unified Lower Bound for Selection and Set Partitioning Problems , 1981, JACM.
[3] Harold N. Gabow,et al. A Counting Approach to Lower Bounds for Selection Problems , 1979, JACM.
[4] Andrew Chi-Chih Yao,et al. A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests , 1994, Inf. Process. Lett..
[5] Rudolf Fleischer,et al. Decision trees: old and new results , 1993, Inf. Comput..
[6] Laurent Hyafil. Bounds for Selection , 1976, SIAM J. Comput..
[7] Edward M. Reingold,et al. Computing the Maximum and the Median , 1971, SWAT.
[8] Vaughan R. Pratt,et al. On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.
[9] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[10] William I. Gasarch. On Selecting the k Largest with Restricted Quadratic Queries , 1991, Inf. Process. Lett..