Author of the publication

Establishing lower bounds on algorithms: a survey.

. AFIPS Spring Joint Computing Conference, volume 40 of AFIPS Conference Proceedings, page 471-481. AFIPS, (1972)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Aspects of insertion in random trees., and . Computing, 29 (1): 11-29 (1982)Heuristics for Weighted Perfect Matching, , and . STOC, page 398-419. ACM, (1980)Understanding the Complexity of Interpolation Search., and . Inf. Process. Lett., 6 (6): 219-222 (1977)Average-case lower bounds for the plurality problem., and . ACM Trans. Algorithms, 4 (3): 27:1-27:17 (2008)Binary Search Trees of Bounded Balance, and . STOC, page 137-142. ACM, (1972)Ordinal Arithmetic with List Structures., and . LFCS, volume 620 of Lecture Notes in Computer Science, page 117-126. Springer, (1992)Automating introductory computer science courses., and . SIGCSE, page 24-25. ACM, (1973)Basic Techniques for Design and Analysis of Algorithms.. The Computer Science and Engineering Handbook, CRC Press, (1997)Simple Proofs of Lower Bounds for Polynomial Evaluation., and . Complexity of Computer Computations, page 21-30. Plenum Press, New York, (1972)Basic techniques for design and analysis of algorithms. ACM Comput. Surv., 28 (1): 19--21 (1996)