Randomized binary searching with tree structuresClampett, Harry A. · Communications of the ACM · 1964

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1533 || Randomized K-Dimensional Binary Search TreesChwa, Kyung-Yong; Ibarra, Oscar H. · 1998

Optimal Sampling Strategies in Quicksort and QuickselectMartínez, Conrado; Roura, Salvador · SIAM Journal on Computing · 2001

Abstraction in query processingImielinski, Tomasz · Journal of the ACM · 1991

The PCP theorem by gap amplificationDinur, Irit · Journal of the ACM · 2007

New Methods in Automatic ExtractingEdmundson, H. P. · Journal of the ACM · 1969

Inference of Reversible LanguagesAngluin, Dana · Journal of the ACM · 1982

Eigenvalues and expansion of regular graphsKahale, Nabil · Journal of the ACM · 1995

An Algorithm for Convex PolytopesChand, Donald R.; Kapur, Sham S. · Journal of the ACM · 1970

How to construct random functionsGoldreich, Oded; Goldwasser, Shafi; Micali, Silvio · Journal of the ACM · 1986

An Algorithm for Subgraph IsomorphismUllmann, J. R. · Journal of the ACM · 1976