Jon Louis Bentley

According to our database1, Jon Louis Bentley authored at least 102 papers between 1974 and 2014.

Collaborative distances:



In proceedings 
PhD thesis 





Selecting Data for Experiments: Past, Present and Future.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

In the realm of insight and creativity.
Commun. ACM, 2008

Learning from Experience: 11178.
Am. Math. Mon., 2007

Tiny Experiments for Algorithms and Life.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images.
Proceedings of the 18th International Conference on Pattern Recognition (ICPR 2006), 2006

CAPTCHA challenge strings: problems and improvements.
Proceedings of the Document Recognition and Retrieval XIII, 2006

Problem 11178.
Am. Math. Mon., 2005

Query-directed passwords.
Comput. Secur., 2005

How Much Assurance Does a PIN Provide?
Proceedings of the Human Interactive Proofs, Second International Workshop, 2005

Using Information Extraction for Quality Analysis in Human Authentication.
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

Implicit CAPTCHAs.
Proceedings of the Document Recognition and Retrieval XII, 2005

Call Center Customer Verification by Query-Directed Passwords.
Proceedings of the Financial Cryptography, 2004

Experiments for Algorithm Engineering.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Data compression with long repeated strings.
Inf. Sci., 2001

Excerpt from Programming Pearls: The Back of the Envelope.
IEEE Softw., 1999

Data Compression Using Long Common Strings.
Proceedings of the Data Compression Conference, 1999

Fast Algorithms for Sorting and Searching Strings.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Template-driven interfaces for numerical subroutines.
ACM Trans. Math. Softw., 1993

Engineering a Sort Function.
Softw. Pract. Exp., 1993

Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls.
Algorithmica, 1993

Fast Algorithms for Geometric Traveling Salesman Problems.
INFORMS J. Comput., 1992

A System for Algorithm Animation.
Comput. Syst., 1991

Experiments on Traveling Salesman Heuristics.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

K-d Trees for Semidynamic Point Sets.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

A Randomized Data Structure for Ordered Sets.
Advances in Computing Research, 1989

Tools for Printing Indexes.
Electronic Publishing, 1988

Teaching the Tricks of the Trade.
Proceedings of the Software Engineering Education, 1988

More programming pearls - confessions of a coder.
Addison-Wesley, ISBN: 978-0-201-11889-6, 1988

Exercises in Software Design.
IEEE Trans. Software Eng., 1987

Chem - a program for phototypesetting chemical structure diagrams.
Comput. Chem., 1987

The Furbelow Memorandum.
Commun. ACM, 1987

A Sample of Brilliance.
Commun. ACM, 1987

Self-Describing Data.
Commun. ACM, 1987

Abstract Data Types.
Commun. ACM, 1987

A Locally Adaptive Data Compression Scheme.
Commun. ACM, 1986

GRAP - A Language for Typesetting Graphs.
Commun. ACM, 1986

Birth of a Cruncher.
Commun. ACM, 1986

Document Design.
Commun. ACM, 1986

Little Languages.
Commun. ACM, 1986

A Literate Program.
Commun. ACM, 1986

Literate Programming.
Commun. ACM, 1986

Cutting the Gordian Knot.
Commun. ACM, 1986

Programming pearls.
Addison-Wesley, ISBN: 978-0-201-10331-1, 1986

Amortized Analyses of Self-Organizing Sequential Search Heuristics.
Commun. ACM, 1985

Commun. ACM, 1985

Bumper-Sticker Computer Science.
Commun. ACM, 1985

Confessions of a Coder.
Commun. ACM, 1985

Associative Arrays.
Commun. ACM, 1985

A Spelling Checker.
Commun. ACM, 1985

Thanks, Heaps.
Commun. ACM, 1985

Tricks of the Trade.
Commun. ACM, 1985

A Case Study in Applied Algorithm Design.
IEEE Computer, 1984

A Little Program, A Lot of Fun.
Commun. ACM, 1984

Perspective on Performance.
Commun. ACM, 1984

Algorithm Design Techniques.
Commun. ACM, 1984

Commun. ACM, 1984

Graphic Output.
Commun. ACM, 1984

Squeezing Space.
Commun. ACM, 1984

How to Sort.
Commun. ACM, 1984

The Back of the Envelope.
Commun. ACM, 1984

Code Tuning.
Commun. ACM, 1984

Scaling and Related Techniques for Geometry Problems
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Some Unexpected Expected Behavior Results for Bin Packing
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Writing Correct Programs.
Commun. ACM, 1983

Data Structures Programs.
Commun. ACM, 1983

Aha! Algorithms.
Commun. ACM, 1983

Cracking the Oyster.
Commun. ACM, 1983

A General Class of Resource Tradeoffs.
J. Comput. Syst. Sci., 1982

Approximation Algorithms for Convex Hulls.
Commun. ACM, 1982

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

An Alphard Specification of a Correct and Efficient Transformation on Data Structures.
IEEE Trans. Software Eng., 1980

Optimal Expected-Time Algorithms for Closest Point Problems.
ACM Trans. Math. Softw., 1980

Generating Sorted Lists of Random Numbers.
ACM Trans. Math. Softw., 1980

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles.
IEEE Trans. Computers, 1980

Decomposable Searching Problems I: Static-to-Dynamic Transformation.
J. Algorithms, 1980

A Parallel Algorithm for Constructing Minimum Spanning Trees.
J. Algorithms, 1980

Multidimensional Divide-and-Conquer.
Commun. ACM, 1980

Efficient Worst-Case Data Structures for Range Searching.
Acta Informatica, 1980

The Power of a One-Dimensional Vector of Processors.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Preparing the NAG library.
Proceedings of the Problems and Methodologies in Mathematical Software Production, 1980

A Worst-Case Analysis of Nearest Neighbor Searching by Projection.
Proceedings of the Automata, 1980

A General Class of Resource Tradeoffs (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

Multidimensional Binary Search Trees in Database Applications.
IEEE Trans. Software Eng., 1979

Algorithms for Reporting and Counting Geometric Intersections.
IEEE Trans. Computers, 1979

The NAG Library 'Machine'.
Softw. Pract. Exp., 1979

A Note on Euclidean Near Neighbor Searching in the Plane.
Inf. Process. Lett., 1979

Decomposable Searching Problems.
Inf. Process. Lett., 1979

Data Structures for Range Searching.
ACM Comput. Surv., 1979

Introduction to Algorithm Design.
IEEE Computer, 1979

Transforming Static Data Structures to Dynamic Structures (Abridged Version)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces.
IEEE Trans. Computers, 1978

On the Average Number of Maxima in a Set of Vectors and Applications.
J. ACM, 1978

Divide and Conquer for Linear Expected Time.
Inf. Process. Lett., 1978

An Algorithm for Finding Best Matches in Logarithmic Expected Time.
ACM Trans. Math. Softw., 1977

The Complexity of Finding Fixed-Radius Near Neighbors.
Inf. Process. Lett., 1977

An Almost Optimal Algorithm for Unbounded Searching.
Inf. Process. Lett., 1976

Heuristics for Partial-Match Retrieval Data Base Design.
Inf. Process. Lett., 1976

Divide-and-Conquer in Multidimensional Space
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

On the Enhancement of Portability within the NAG Project - Statistical Survey.
Proceedings of the Portability of Numerical Software, 1976

Analysis of Range Searches in Quad Trees.
Inf. Process. Lett., 1975

Multidimensional Binary Search Trees Used for Associative Searching.
Commun. ACM, 1975

Quad Trees: A Data Structure for Retrieval on Composite Keys.
Acta Informatica, 1974