Author:
Guimar�es Katia S.,Gasarch William I.,Purtilo Jim
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference10 articles.
1. F. Fussenegger andH. N. Gabow, A Counting Approach to Lower Bounds for Selection Problems,J. Assoc. Comput. Mach. 26 (1979), 227?238.
2. W. I. Gasarch, On Selecting thek Largest with Restricted Quadratic Queries,Information Proc. Letters 38 (1991), 193?195.
3. J. W. John, A New Lower Bound for the Set-Partitioning Problem,SIAM J. Computing 17 (1988), 640?647.
4. D. E. Knuth,The Art of Computer Programming, vol. 3-Sorting and Searching, Addison Wesley, 1973.
5. S. Moran, M. Snir, andU. Manber, Applications of Ramsey's Theorem to Decision Tree Complexity,J. Assoc. Comput. Mach. 32 (1985), 938?949.