Quad Trees: A Data Structure for Retrieval on Composite Keys. - Raphael A. Finkel; Jon Louis Bentley (Acta Informatica, 1974)

Multidimensional Binary Search Trees Used for Associative Searching. - Jon Louis Bentley (Commun. ACM, 1975)

Analysis of Range Searches in Quad Trees. - Jon Louis Bentley; Donald F. Stanat (Inf. Process. Lett., 1975)

On the Enhancement of Portability within the NAG Project - Statistical Survey. - Jon Louis Bentley; Brian Ford (Portability of Numerical Software, 1976)

Divide-and-Conquer in Multidimensional Space - Jon Louis Bentley; Michael Ian Shamos (STOC, 1976)

Heuristics for Partial-Match Retrieval Data Base Design. - Jon Louis Bentley; Walter A. Burkhard (Inf. Process. Lett., 1976)

An Almost Optimal Algorithm for Unbounded Searching. - Jon Louis Bentley; Andrew Chi-Chih Yao (Inf. Process. Lett., 1976)

The Complexity of Finding Fixed-Radius Near Neighbors. - Jon Louis Bentley; Donald F. Stanat; E. Hollins Williams Jr. (Inf. Process. Lett., 1977)

An Algorithm for Finding Best Matches in Logarithmic Expected Time. - Jerome H. Friedman; Jon Louis Bentley; Raphael A. Finkel (ACM Trans. Math. Softw., 1977)

Divide and Conquer for Linear Expected Time. - Jon Louis Bentley; Michael Ian Shamos (Inf. Process. Lett., 1978)

On the Average Number of Maxima in a Set of Vectors and Applications. - Jon Louis Bentley; H. T. Kung 001; Mario Schkolnick; Clark D. Thompson (J. ACM, 1978)

Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. - Jon Louis Bentley; Jerome H. Friedman (IEEE Trans. Computers, 1978)

Transforming Static Data Structures to Dynamic Structures (Abridged Version) - James B. Saxe; Jon Louis Bentley (FOCS, 1979)

Introduction to Algorithm Design. - Jon Louis Bentley (Computer, 1979)

Data Structures for Range Searching. - Jon Louis Bentley; Jerome H. Friedman (ACM Comput. Surv., 1979)

Decomposable Searching Problems. - Jon Louis Bentley (Inf. Process. Lett., 1979)

A Note on Euclidean Near Neighbor Searching in the Plane. - Jon Louis Bentley; Hermann A. Maurer (Inf. Process. Lett., 1979)

Algorithms on vector sets. - Jon Louis Bentley; James B. Saxe (SIGACT News, 1979)

The NAG Library 'Machine'. - Brian Ford; Jon Louis Bentley; J. J. Du Croz; Stephen J. Hague (Softw. Pract. Exp., 1979)

Algorithms for Reporting and Counting Geometric Intersections. - Jon Louis Bentley; Thomas Ottmann (IEEE Trans. Computers, 1979)

Multidimensional Binary Search Trees in Database Applications. - Jon Louis Bentley (IEEE Trans. Software Eng., 1979)

A General Class of Resource Tradeoffs (Extended Abstract) - Jon Louis Bentley; Donna J. Brown (FOCS, 1980)

A Worst-Case Analysis of Nearest Neighbor Searching by Projection. - Christos H. Papadimitriou; Jon Louis Bentley (ICALP, 1980)

Preparing the NAG library. - Brian Ford; Jon Louis Bentley; J. J. Du Croz; Stephen J. Hague (Problems and Methodologies in Mathematical Software Production, 1980)

The Power of a One-Dimensional Vector of Processors. - Jon Louis Bentley; Thomas Ottmann (WG, 1980)

Efficient Worst-Case Data Structures for Range Searching. - Jon Louis Bentley; Hermann A. Maurer (Acta Informatica, 1980)

Multidimensional Divide-and-Conquer. - Jon Louis Bentley (Commun. ACM, 1980)

A Parallel Algorithm for Constructing Minimum Spanning Trees. - Jon Louis Bentley (J. Algorithms, 1980)

Decomposable Searching Problems I: Static-to-Dynamic Transformation. - Jon Louis Bentley; James B. Saxe (J. Algorithms, 1980)

A general method for solving divide-and-conquer recurrences. - Jon Louis Bentley; Dorothea Haken; James B. Saxe (SIGACT News, 1980)

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. - Jon Louis Bentley; Derick Wood (IEEE Trans. Computers, 1980)

Generating Sorted Lists of Random Numbers. - Jon Louis Bentley; James B. Saxe (ACM Trans. Math. Softw., 1980)

Optimal Expected-Time Algorithms for Closest Point Problems. - Jon Louis Bentley; Bruce W. Weide; Andrew Chi-Chih Yao (ACM Trans. Math. Softw., 1980)

An Alphard Specification of a Correct and Efficient Transformation on Data Structures. - Jon Louis Bentley; Mary Shaw (IEEE Trans. Software Eng., 1980)

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. - Jon Louis Bentley; Thomas Ottmann (MFCS, 1981)

Approximation Algorithms for Convex Hulls. - Jon Louis Bentley; Mark G. Faust; Franco P. Preparata (Commun. ACM, 1982)

A General Class of Resource Tradeoffs. - Jon Louis Bentley; Donna J. Brown (J. Comput. Syst. Sci., 1982)

Cracking the Oyster. - Jon Louis Bentley (Commun. ACM, 1983)

Aha! Algorithms. - Jon Louis Bentley (Commun. ACM, 1983)

Data Structures Programs. - Jon Louis Bentley (Commun. ACM, 1983)

Writing Correct Programs. - Jon Louis Bentley (Commun. ACM, 1983)

Some Unexpected Expected Behavior Results for Bin Packing - Jon Louis Bentley; David S. Johnson 001; Frank Thomson Leighton; Catherine C. McGeoch; Lyle A. McGeoch (STOC, 1984)

Scaling and Related Techniques for Geometry Problems - Harold N. Gabow; Jon Louis Bentley; Robert Endre Tarjan (STOC, 1984)

Code Tuning. - Jon Louis Bentley (Commun. ACM, 1984)

The Back of the Envelope. - Jon Louis Bentley (Commun. ACM, 1984)

How to Sort. - Jon Louis Bentley (Commun. ACM, 1984)

Squeezing Space. - Jon Louis Bentley (Commun. ACM, 1984)

Graphic Output. - Jon Louis Bentley (Commun. ACM, 1984)

Updates. - Jon Louis Bentley (Commun. ACM, 1984)

Algorithm Design Techniques. - Jon Louis Bentley (Commun. ACM, 1984)

Perspective on Performance. - Jon Louis Bentley (Commun. ACM, 1984)

A Little Program, A Lot of Fun. - Jon Louis Bentley (Commun. ACM, 1984)

A Case Study in Applied Algorithm Design. - Jon Louis Bentley (Computer, 1984)

The role of performance in the software process. - Jon Louis Bentley (ISPW, 1985)

Tricks of the Trade. - Jon Louis Bentley (Commun. ACM, 1985)

Thanks, Heaps. - Jon Louis Bentley (Commun. ACM, 1985)

A Spelling Checker. - Jon Louis Bentley (Commun. ACM, 1985)

Associative Arrays. - Jon Louis Bentley (Commun. ACM, 1985)

Confessions of a Coder. - Jon Louis Bentley (Commun. ACM, 1985)

Bumper-Sticker Computer Science. - Jon Louis Bentley (Commun. ACM, 1985)

Selection. - Jon Louis Bentley (Commun. ACM, 1985)

Amortized Analyses of Self-Organizing Sequential Search Heuristics. - Jon Louis Bentley; Catherine C. McGeoch (Commun. ACM, 1985)

Programming pearls. - Jon Louis Bentley (Addison-Wesley, 1986)

Cutting the Gordian Knot. - Jon Louis Bentley (Commun. ACM, 1986)

Literate Programming. - Jon Louis Bentley (Commun. ACM, 1986)

A Literate Program. - Jon Louis Bentley (Commun. ACM, 1986)

Little Languages. - Jon Louis Bentley (Commun. ACM, 1986)

Document Design. - Jon Louis Bentley (Commun. ACM, 1986)

Birth of a Cruncher. - Jon Louis Bentley (Commun. ACM, 1986)

GRAP - A Language for Typesetting Graphs. - Jon Louis Bentley; Brian W. Kernighan (Commun. ACM, 1986)

A Locally Adaptive Data Compression Scheme. - Jon Louis Bentley; Daniel Dominic Sleator; Robert Endre Tarjan; Victor K. Wei (Commun. ACM, 1986)

Abstract Data Types. - Jon Louis Bentley (Commun. ACM, 1987)

Self-Describing Data. - Jon Louis Bentley (Commun. ACM, 1987)

A Sample of Brilliance. - Jon Louis Bentley (Commun. ACM, 1987)

The Furbelow Memorandum. - Jon Louis Bentley (Commun. ACM, 1987)

Chem - a program for phototypesetting chemical structure diagrams. - Jon Louis Bentley; Lynn W. Jelinski; Brian W. Kernighan (Comput. Chem., 1987)

Exercises in Software Design. - Jon Louis Bentley; John A. Dallen (IEEE Trans. Software Eng., 1987)

More programming pearls - confessions of a coder. - Jon Louis Bentley (Addison-Wesley, 1988)

Teaching the Tricks of the Trade. - Jon Louis Bentley (CSEE, 1988)

Tools for Printing Indexes. - Jon Louis Bentley; Brian W. Kernighan (Electron. Publ., 1988)

A Randomized Data Structure for Ordered Sets. - Jon Louis Bentley; Frank Thomson Leighton; Margaret Lepley; Donald F. Stanat; J. Michael Steele (Adv. Comput. Res., 1989)

K-d Trees for Semidynamic Point Sets. - Jon Louis Bentley (SCG, 1990)

Experiments on Traveling Salesman Heuristics. - Jon Louis Bentley (SODA, 1990)

A System for Algorithm Animation. - Jon Louis Bentley; Brian W. Kernighan (Comput. Syst., 1991)

Fast Algorithms for Geometric Traveling Salesman Problems. - Jon Louis Bentley (INFORMS J. Comput., 1992)

Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. - Jon Louis Bentley; Kenneth L. Clarkson; David B. Levine (Algorithmica, 1993)

Engineering a Sort Function. - Jon Louis Bentley; M. Douglas McIlroy (Softw. Pract. Exp., 1993)

Template-driven interfaces for numerical subroutines. - Jon Louis Bentley; Mary F. Fernandez; Brian W. Kernighan; Norman L. Schryer (ACM Trans. Math. Softw., 1993)

Fast Algorithms for Sorting and Searching Strings. - Jon Louis Bentley; Robert Sedgewick (SODA, 1997)

Data Compression Using Long Common Strings. - Jon Louis Bentley; M. Douglas McIlroy (Data Compression Conference, 1999)

Excerpt from Programming Pearls: The Back of the Envelope. - Jon Louis Bentley (IEEE Softw., 1999)

Data compression with long repeated strings. - Jon Louis Bentley; M. Douglas McIlroy (Inf. Sci., 2001)

Truth, beauty and engineering: what I'd like my CS kids to learn (keynote session). - Jon Louis Bentley (J. Comput. Sci. Coll., 2001)

Experiments for Algorithm Engineering. - Jon Louis Bentley (COCOON, 2003)

Call Center Customer Verification by Query-Directed Passwords. - Lawrence O'Gorman; Amit Bagga; Jon Louis Bentley (Financial Cryptography, 2004)

Implicit CAPTCHAs. - Henry S. Baird; Jon Louis Bentley (DRR, 2005)

Using Information Extraction for Quality Analysis in Human Authentication. - Kiyoshi Sudo; Amit Bagga; Lawrence O'Gorman; Jon Louis Bentley (HICSS, 2005)

How Much Assurance Does a PIN Provide? - Jon Louis Bentley; Colin L. Mallows (HIP, 2005)

Query-directed passwords. - Lawrence O'Gorman; Amit Bagga; Jon Louis Bentley (Comput. Secur., 2005)

Problem 11178. - Jon Louis Bentley; Colin L. Mallows (Am. Math. Mon., 2005)

CAPTCHA challenge strings: problems and improvements. - Jon Louis Bentley; Colin L. Mallows (DRR, 2006)

CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images. - Sui-Yu Wang; Jon Louis Bentley (ICPR (3), 2006)

Tiny Experiments for Algorithms and Life. - Jon Louis Bentley (WEA, 2006)

Learning from Experience: 11178. - Jon Louis Bentley; Colin L. Mallows; Richard Stong (Am. Math. Mon., 2007)

In the realm of insight and creativity. - Jon Louis Bentley (Commun. ACM, 2008)

Selecting Data for Experiments: Past, Present and Future. - Jon Louis Bentley (SEA, 2014)