Jon Louis Bentley

Jon Louis Bentley: In the realm of insight and creativity. Commun. ACM 51(1): 52-54 (2008)

Jon Louis Bentley, Colin Mallows, Richard Stong: Learning from Experience: 11178. The American Mathematical Monthly 114(6): 549-550 (2007)

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

Jon Louis Bentley: Tiny Experiments for Algorithms and Life. WEA 2006: 182-182

Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley: Query-directed passwords. Computers & Security 24(7): 546-560 (2005)

Jon Louis Bentley, Colin Mallows: Problem 11178. The American Mathematical Monthly 112(8): 750 (2005)

Henry S. Baird, Jon Louis Bentley: Implicit CAPTCHAs. DRR 2005: 191-196

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

Jon Louis Bentley, Colin Mallows: How Much Assurance Does a PIN Provide? HIP 2005: 111-126

Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley: Call Center Customer Verification by Query-Directed Passwords. Financial Cryptography 2004: 54-67

Jon Louis Bentley: Experiments for Algorithm Engineering. COCOON 2003: 3-4

Jon Louis Bentley, M. Douglas McIlroy: Data compression with long repeated strings. Inf. Sci. 135(1-2): 1-11 (2001)

Jon Louis Bentley: Excerpt from Programming Pearls: The Back of the Envelope. IEEE Software 16(5): 121-125 (1999)

Jon Louis Bentley, M. Douglas McIlroy: Data Compression Using Long Common Strings. Data Compression Conference 1999: 287-295

Jon Louis Bentley, Robert Sedgewick: Fast Algorithms for Sorting and Searching Strings. SODA 1997: 360-369

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

Jon Louis Bentley, M. Douglas McIlroy: Engineering a Sort Function. Softw., Pract. Exper. 23(11): 1249-1265 (1993)

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

Jon Louis Bentley: Fast Algorithms for Geometric Traveling Salesman Problems. INFORMS Journal on Computing 4(4): 387-411 (1992)

Jon Louis Bentley, Brian W. Kernighan: A System for Algorithm Animation. Computing Systems 4(1): 5-30 (1991)

Jon Louis Bentley: K-d Trees for Semidynamic Point Sets. Symposium on Computational Geometry 1990: 187-197

Jon Louis Bentley: Experiments on Traveling Salesman Heuristics. SODA 1990: 91-99

Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine: Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA 1990: 179-187

Jon Louis Bentley, Brian W. Kernighan: Tools for Printing Indexes. Electronic Publishing 1(1): 3-17 (1988)

Jon Louis Bentley: Teaching the Tricks of the Trade. CSEE 1988: 1-8

Jon Louis Bentley: Self-Describing Data. Commun. ACM 30(6): 479-483 (1987)

Jon Louis Bentley: A Sample of Brilliance. Commun. ACM 30(9): 754-757 (1987)

Jon Louis Bentley: The Furbelow Memorandum. Commun. ACM 30(12): 998-999 (1987)

Jon Louis Bentley, Lynn W. Jelinski, Brian W. Kernighan: Chem - a program for phototypesetting chemical structure diagrams. Computers & Chemistry 11(4): 281-297 (1987)

Jon Louis Bentley, John A. Dallen: Exercises in Software Design. IEEE Trans. Software Eng. 13(11): 1164-1169 (1987)

Jon Louis Bentley: Programming pearls. Addison-Wesley 1986, isbn 978-0-201-10331-1, pp. I-VIII, 1-195

Jon Louis Bentley: Cutting the Gordian Knot. Commun. ACM 29(2): 92-96 (1986)

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

Jon Louis Bentley: Literate Programming. Commun. ACM 29(5): 364-369 (1986)

Jon Louis Bentley: A Literate Program. Commun. ACM 29(6): 471-483 (1986)

Jon Louis Bentley: Little Languages. Commun. ACM 29(8): 711-721 (1986)

Jon Louis Bentley, Brian W. Kernighan: GRAP - A Language for Typesetting Graphs. Commun. ACM 29(8): 782-792 (1986)

Jon Louis Bentley: Document Design. Commun. ACM 29(9): 832-839 (1986)

Jon Louis Bentley: Birth of a Cruncher. Commun. ACM 29(12): 1155-1161 (1986)

Jon Louis Bentley: Tricks of the Trade. Commun. ACM 28(2): 138-141 (1985)

Jon Louis Bentley: Thanks, Heaps. Commun. ACM 28(3): 245-250 (1985)

Jon Louis Bentley, Catherine C. McGeoch: Amortized Analyses of Self-Organizing Sequential Search Heuristics. Commun. ACM 28(4): 404-411 (1985)

Jon Louis Bentley: A Spelling Checker. Commun. ACM 28(5): 456-462 (1985)

Jon Louis Bentley: Associative Arrays. Commun. ACM 28(6): 570-576 (1985)

Jon Louis Bentley: Confessions of a Coder. Commun. ACM 28(7): 671-679 (1985)

Jon Louis Bentley: Bumper-Sticker Computer Science. Commun. ACM 28(9): 896-901 (1985)

Jon Louis Bentley: Selection. Commun. ACM 28(11): 1121-1127 (1985)

Jon Louis Bentley: Code Tuning. Commun. ACM 27(2): 91-96 (1984)

Jon Louis Bentley: The Back of the Envelope. Commun. ACM 27(3): 180-184 (1984)

Jon Louis Bentley: How to Sort. Commun. ACM 27(4): 287-291 (1984)

Jon Louis Bentley: Squeezing Space. Commun. ACM 27(5): 416-421 (1984)

Jon Louis Bentley: Graphic Output. Commun. ACM 27(6): 529-536 (1984)

Jon Louis Bentley: Updates. Commun. ACM 27(7): 630-636 (1984)

Jon Louis Bentley: Algorithm Design Techniques. Commun. ACM 27(9): 865-871 (1984)

Jon Louis Bentley: Perspective on Performance. Commun. ACM 27(11): 1087-1092 (1984)

Jon Louis Bentley: A Little Program, A Lot of Fun. Commun. ACM 27(12): 1179-1182 (1984)

Jon Louis Bentley: Abstract Data Types. Commun. ACM 30(4): 284-290 (1984)

Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan: Scaling and Related Techniques for Geometry Problems. STOC 1984: 135-143

Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch: Some Unexpected Expected Behavior Results for Bin Packing. STOC 1984: 279-288

Jon Louis Bentley: Cracking the Oyster. Commun. ACM 26(8): 549-552 (1983)

Jon Louis Bentley: Aha! Algorithms. Commun. ACM 26(9): 623-628 (1983)

Jon Louis Bentley: Data Structures Programs. Commun. ACM 26(10): 726-730 (1983)

Jon Louis Bentley: Writing Correct Programs. Commun. ACM 26(12): 1040-1045 (1983)

Jon Louis Bentley, Mark G. Faust, Franco P. Preparata: Approximation Algorithms for Convex Hulls. Commun. ACM 25(1): 64-68 (1982)

Jon Louis Bentley, Donna J. Brown: A General Class of Resource Tradeoffs. J. Comput. Syst. Sci. 25(2): 214-238 (1982)

Jon Louis Bentley, Thomas Ottmann: The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. MFCS 1981: 1-15

Jon Louis Bentley, Hermann A. Maurer: Efficient Worst-Case Data Structures for Range Searching. Acta Inf. 13: 155-168 (1980)

Jon Louis Bentley: Multidimensional Divide-and-Conquer. Commun. ACM 23(4): 214-229 (1980)

Jon Louis Bentley: A Parallel Algorithm for Constructing Minimum Spanning Trees. J. Algorithms 1(1): 51-59 (1980)

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

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

Jon Louis Bentley, James B. Saxe: Generating Sorted Lists of Random Numbers. ACM Trans. Math. Softw. 6(3): 359-364 (1980)

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

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

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

Christos H. Papadimitriou, Jon Louis Bentley: A Worst-Case Analysis of Nearest Neighbor Searching by Projection. ICALP 1980: 470-482

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

Jon Louis Bentley, Thomas Ottmann: The Power of a One-Dimensional Vector of Processors. WG 1980: 80-89

Jon Louis Bentley: Introduction to Algorithm Design. IEEE Computer 12(2): 66-78 (1979)

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409 (1979)

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

Jon Louis Bentley: Decomposable Searching Problems. Inf. Process. Lett. 8(5): 244-251 (1979)

Brian Ford, Jon Louis Bentley, J. J. Du Croz, Stephen J. Hague: The NAG Library 'Machine'. Softw., Pract. Exper. 9(1): 65-72 (1979)

Jon Louis Bentley, Thomas Ottmann: Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. Computers 28(9): 643-647 (1979)

Jon Louis Bentley: Multidimensional Binary Search Trees in Database Applications. IEEE Trans. Software Eng. 5(4): 333-340 (1979)

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

Jon Louis Bentley, Michael Ian Shamos: Divide and Conquer for Linear Expected Time. Inf. Process. Lett. 7(2): 87-91 (1978)

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

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

Jon Louis Bentley, Donald F. Stanat, E. Hollings Williams Jr.: The Complexity of Finding Fixed-Radius Near Neighbors. Inf. Process. Lett. 6(6): 209-212 (1977)

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

Jon Louis Bentley, Walter A. Burkhard: Heuristics for Partial-Match Retrieval Data Base Design. Inf. Process. Lett. 4(5): 132-135 (1976)

Jon Louis Bentley, Andrew Chi-Chih Yao: An Almost Optimal Algorithm for Unbounded Searching. Inf. Process. Lett. 5(3): 82-87 (1976)

Jon Louis Bentley, Brian Ford: On the Enhancement of Portability within the NAG Project - Statistical Survey. Portability of Numerical Software 1976: 505-528

Jon Louis Bentley, Michael Ian Shamos: Divide-and-Conquer in Multidimensional Space. STOC 1976: 220-230

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517 (1975)

Jon Louis Bentley, Donald F. Stanat: Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173 (1975)

Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9 (1974)