Jon Louis Bentley

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2008

In the realm of insight and creativity.

[BibT_eX]

[DOI]

Commun. ACM, 2008

2007

Learning from Experience: 11178.

[BibT_eX]

[DOI]

Richard Stong

Am. Math. Mon., 2007

2006

Tiny Experiments for Algorithms and Life.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images.

[BibT_eX]

[DOI]

Sui-Yu Wang

Proceedings of the 18th International Conference on Pattern Recognition (ICPR 2006), 2006

CAPTCHA challenge strings: problems and improvements.

[BibT_eX]

[DOI]

Proceedings of the Document Recognition and Retrieval XIII, 2006

2005

Problem 11178.

[BibT_eX]

[DOI]

Am. Math. Mon., 2005

Query-directed passwords.

[BibT_eX]

[DOI]

Lawrence O'Gorman

Amit Bagga

Comput. Secur., 2005

How Much Assurance Does a PIN Provide?

[BibT_eX]

[DOI]

Proceedings of the Human Interactive Proofs, Second International Workshop, 2005

Using Information Extraction for Quality Analysis in Human Authentication.

[BibT_eX]

[DOI]

Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

Implicit CAPTCHAs.

[BibT_eX]

[DOI]

Henry S. Baird

Proceedings of the Document Recognition and Retrieval XII, 2005

2004

Call Center Customer Verification by Query-Directed Passwords.

[BibT_eX]

[DOI]

Lawrence O'Gorman

Amit Bagga

Proceedings of the Financial Cryptography, 2004

2003

Experiments for Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2001

Data compression with long repeated strings.

[BibT_eX]

[DOI]

M. Douglas McIlroy

Inf. Sci., 2001

1999

Excerpt from Programming Pearls: The Back of the Envelope.

[BibT_eX]

[DOI]

IEEE Softw., 1999

Data Compression Using Long Common Strings.

[BibT_eX]

[DOI]

M. Douglas McIlroy

Proceedings of the Data Compression Conference, 1999

1997

Fast Algorithms for Sorting and Searching Strings.

[BibT_eX]

[DOI]

Robert Sedgewick

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1993

Template-driven interfaces for numerical subroutines.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1993

Engineering a Sort Function.

[BibT_eX]

[DOI]

M. Douglas McIlroy

Softw. Pract. Exp., 1993

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

[BibT_eX]

[DOI]

Kenneth L. Clarkson

David B. Levine

Algorithmica, 1993

1992

Fast Algorithms for Geometric Traveling Salesman Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

1991

A System for Algorithm Animation.

[BibT_eX]

[DOI]

Comput. Syst., 1991

1990

Experiments on Traveling Salesman Heuristics.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

K-d Trees for Semidynamic Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

A Randomized Data Structure for Ordered Sets.

[BibT_eX]

Frank Thomson Leighton

Margaret Lepley

Donald F. Stanat

J. Michael Steele

Adv. Comput. Res., 1989

1988

Tools for Printing Indexes.

[BibT_eX]

Electron. Publ., 1988

Teaching the Tricks of the Trade.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering Education, 1988

More programming pearls - confessions of a coder.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-11889-6, 1988

1987

Exercises in Software Design.

[BibT_eX]

[DOI]

John A. Dallen

IEEE Trans. Software Eng., 1987

Chem - a program for phototypesetting chemical structure diagrams.

[BibT_eX]

[DOI]

Lynn W. Jelinski

Comput. Chem., 1987

The Furbelow Memorandum.

[BibT_eX]

Commun. ACM, 1987

A Sample of Brilliance.

[BibT_eX]

[DOI]

Commun. ACM, 1987

Self-Describing Data.

[BibT_eX]

[DOI]

Commun. ACM, 1987

Abstract Data Types.

[BibT_eX]

Commun. ACM, 1987

1986

A Locally Adaptive Data Compression Scheme.

[BibT_eX]

[DOI]

Daniel Dominic Sleator

Robert Endre Tarjan

Victor K. Wei

Commun. ACM, 1986

GRAP - A Language for Typesetting Graphs.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Birth of a Cruncher.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Document Design.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Little Languages.

[BibT_eX]

[DOI]

Commun. ACM, 1986

A Literate Program.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Literate Programming.

[BibT_eX]

Commun. ACM, 1986

Cutting the Gordian Knot.

[BibT_eX]

[DOI]

Commun. ACM, 1986

Programming pearls.

[BibT_eX]

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

1985

Amortized Analyses of Self-Organizing Sequential Search Heuristics.

[BibT_eX]

[DOI]

Catherine C. McGeoch

Commun. ACM, 1985

Selection.

[BibT_eX]

[DOI]

Commun. ACM, 1985

Bumper-Sticker Computer Science.

[BibT_eX]

Commun. ACM, 1985

Confessions of a Coder.

[BibT_eX]

[DOI]

Commun. ACM, 1985

Associative Arrays.

[BibT_eX]

[DOI]

Commun. ACM, 1985

A Spelling Checker.

[BibT_eX]

[DOI]

Commun. ACM, 1985

Thanks, Heaps.

[BibT_eX]

[DOI]

Commun. ACM, 1985

Tricks of the Trade.

[BibT_eX]

[DOI]

Commun. ACM, 1985

The role of performance in the software process.

[BibT_eX]

Proceedings of an International Workshop on the Software Process and Software Environments, 1985

1984

A Case Study in Applied Algorithm Design.

[BibT_eX]

[DOI]

Computer, 1984

A Little Program, A Lot of Fun.

[BibT_eX]

[DOI]

Commun. ACM, 1984

Perspective on Performance.

[BibT_eX]

[DOI]

Commun. ACM, 1984

Algorithm Design Techniques.

[BibT_eX]

Commun. ACM, 1984

Updates.

[BibT_eX]

Commun. ACM, 1984

Graphic Output.

[BibT_eX]

[DOI]

Commun. ACM, 1984

Squeezing Space.

[BibT_eX]

Commun. ACM, 1984

How to Sort.

[BibT_eX]

Commun. ACM, 1984

The Back of the Envelope.

[BibT_eX]

[DOI]

Commun. ACM, 1984

Code Tuning.

[BibT_eX]

Commun. ACM, 1984

Scaling and Related Techniques for Geometry Problems

[BibT_eX]

[DOI]

Harold N. Gabow

Robert Endre Tarjan

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Some Unexpected Expected Behavior Results for Bin Packing

[BibT_eX]

[DOI]

David S. Johnson

Frank Thomson Leighton

Catherine C. McGeoch

Lyle A. McGeoch

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Writing Correct Programs.

[BibT_eX]

[DOI]

Commun. ACM, 1983

Data Structures Programs.

[BibT_eX]

[DOI]

Commun. ACM, 1983

Aha! Algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 1983

Cracking the Oyster.

[BibT_eX]

[DOI]

Commun. ACM, 1983

1982

A General Class of Resource Tradeoffs.

[BibT_eX]

[DOI]

Donna J. Brown

J. Comput. Syst. Sci., 1982

Approximation Algorithms for Convex Hulls.

[BibT_eX]

[DOI]

Mark G. Faust

Franco P. Preparata

Commun. ACM, 1982

1981

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.

[BibT_eX]

[DOI]

Thomas Ottmann

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

An Alphard Specification of a Correct and Efficient Transformation on Data Structures.

[BibT_eX]

[DOI]

Mary Shaw

IEEE Trans. Software Eng., 1980

Optimal Expected-Time Algorithms for Closest Point Problems.

[BibT_eX]

[DOI]

Bruce W. Weide

Andrew Chi-Chih Yao

ACM Trans. Math. Softw., 1980

Generating Sorted Lists of Random Numbers.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1980

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles.

[BibT_eX]

[DOI]

Derick Wood

IEEE Trans. Computers, 1980

A general method for solving divide-and-conquer recurrences.

[BibT_eX]

[DOI]

Dorothea Haken

SIGACT News, 1980

Decomposable Searching Problems I: Static-to-Dynamic Transformation.

[BibT_eX]

[DOI]

J. Algorithms, 1980

A Parallel Algorithm for Constructing Minimum Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1980

Multidimensional Divide-and-Conquer.

[BibT_eX]

[DOI]

Commun. ACM, 1980

Efficient Worst-Case Data Structures for Range Searching.

[BibT_eX]

[DOI]

Hermann A. Maurer

Acta Informatica, 1980

The Power of a One-Dimensional Vector of Processors.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Thomas Ottmann

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Preparing the NAG library.

[BibT_eX]

[DOI]

Proceedings of the Problems and Methodologies in Mathematical Software Production, 1980

A Worst-Case Analysis of Nearest Neighbor Searching by Projection.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

A General Class of Resource Tradeoffs (Extended Abstract)

[BibT_eX]

[DOI]

Donna J. Brown

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Multidimensional Binary Search Trees in Database Applications.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1979

Algorithms for Reporting and Counting Geometric Intersections.

[BibT_eX]

[DOI]

Thomas Ottmann

IEEE Trans. Computers, 1979

The NAG Library 'Machine'.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1979

Algorithms on vector sets.

[BibT_eX]

[DOI]

SIGACT News, 1979

A Note on Euclidean Near Neighbor Searching in the Plane.

[BibT_eX]

Hermann A. Maurer

Inf. Process. Lett., 1979

Decomposable Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

Data Structures for Range Searching.

[BibT_eX]

[DOI]

Jerome H. Friedman

ACM Comput. Surv., 1979

Introduction to Algorithm Design.

[BibT_eX]

[DOI]

Computer, 1979

Transforming Static Data Structures to Dynamic Structures (Abridged Version)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces.

[BibT_eX]

[DOI]

Jerome H. Friedman

IEEE Trans. Computers, 1978

On the Average Number of Maxima in a Set of Vectors and Applications.

[BibT_eX]

[DOI]

J. ACM, 1978

Divide and Conquer for Linear Expected Time.

[BibT_eX]

[DOI]

Michael Ian Shamos

Inf. Process. Lett., 1978

1977

An Algorithm for Finding Best Matches in Logarithmic Expected Time.

[BibT_eX]

[DOI]

Jerome H. Friedman

Raphael A. Finkel

ACM Trans. Math. Softw., 1977

The Complexity of Finding Fixed-Radius Near Neighbors.

[BibT_eX]

[DOI]

Donald F. Stanat

E. Hollins Williams Jr.

Inf. Process. Lett., 1977

1976

An Almost Optimal Algorithm for Unbounded Searching.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

Inf. Process. Lett., 1976

Heuristics for Partial-Match Retrieval Data Base Design.

[BibT_eX]

[DOI]

Walter A. Burkhard

Inf. Process. Lett., 1976

Divide-and-Conquer in Multidimensional Space

[BibT_eX]

[DOI]

Michael Ian Shamos

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

On the Enhancement of Portability within the NAG Project - Statistical Survey.

[BibT_eX]

[DOI]

Brian Ford

Proceedings of the Portability of Numerical Software, 1976

1975

Analysis of Range Searches in Quad Trees.

[BibT_eX]

[DOI]

Donald F. Stanat

Inf. Process. Lett., 1975

Multidimensional Binary Search Trees Used for Associative Searching.

[BibT_eX]

[DOI]

Commun. ACM, 1975

1974

Quad Trees: A Data Structure for Retrieval on Composite Keys.

[BibT_eX]

[DOI]

Raphael A. Finkel