default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJon Louis Bentley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c26]Jon Louis Bentley:
Selecting Data for Experiments: Past, Present and Future. SEA 2014: 1-9
2000 – 2009
- 2008
- [j78]Jon Louis Bentley:
In the realm of insight and creativity. Commun. ACM 51(1): 52-54 (2008) - 2007
- [j77]Jon Louis Bentley, Colin L. Mallows, Richard Stong:
Learning from Experience: 11178. Am. Math. Mon. 114(6): 549-550 (2007) - 2006
- [c25]Jon Louis Bentley, Colin L. Mallows:
CAPTCHA challenge strings: problems and improvements. DRR 2006: 60670H - [c24]Sui-Yu Wang, Jon Louis Bentley:
CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images. ICPR (3) 2006: 164-167 - [c23]Jon Louis Bentley:
Tiny Experiments for Algorithms and Life. WEA 2006: 182-182 - 2005
- [j76]Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley:
Query-directed passwords. Comput. Secur. 24(7): 546-560 (2005) - [j75]Jon Louis Bentley, Colin L. Mallows:
Problem 11178. Am. Math. Mon. 112(8): 750 (2005) - [c22]Henry S. Baird, Jon Louis Bentley:
Implicit CAPTCHAs. DRR 2005: 191-196 - [c21]Kiyoshi Sudo, Amit Bagga, Lawrence O'Gorman, Jon Louis Bentley:
Using Information Extraction for Quality Analysis in Human Authentication. HICSS 2005 - [c20]Jon Louis Bentley, Colin L. Mallows:
How Much Assurance Does a PIN Provide? HIP 2005: 111-126 - 2004
- [c19]Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley:
Call Center Customer Verification by Query-Directed Passwords. Financial Cryptography 2004: 54-67 - 2003
- [c18]Jon Louis Bentley:
Experiments for Algorithm Engineering. COCOON 2003: 3-4 - 2001
- [j74]Jon Louis Bentley, M. Douglas McIlroy:
Data compression with long repeated strings. Inf. Sci. 135(1-2): 1-11 (2001)
1990 – 1999
- 1999
- [j73]Jon Louis Bentley:
Excerpt from Programming Pearls: The Back of the Envelope. IEEE Softw. 16(5): 121-125 (1999) - [c17]Jon Louis Bentley, M. Douglas McIlroy:
Data Compression Using Long Common Strings. Data Compression Conference 1999: 287-295 - 1997
- [c16]Jon Louis Bentley, Robert Sedgewick:
Fast Algorithms for Sorting and Searching Strings. SODA 1997: 360-369 - 1993
- [j72]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) - [j71]Jon Louis Bentley, M. Douglas McIlroy:
Engineering a Sort Function. Softw. Pract. Exp. 23(11): 1249-1265 (1993) - [j70]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) - 1992
- [j69]Jon Louis Bentley:
Fast Algorithms for Geometric Traveling Salesman Problems. INFORMS J. Comput. 4(4): 387-411 (1992) - 1991
- [j68]Jon Louis Bentley, Brian W. Kernighan:
A System for Algorithm Animation. Comput. Syst. 4(1): 5-30 (1991) - 1990
- [c15]Jon Louis Bentley:
K-d Trees for Semidynamic Point Sets. SCG 1990: 187-197 - [c14]Jon Louis Bentley:
Experiments on Traveling Salesman Heuristics. SODA 1990: 91-99 - [c13]Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA 1990: 179-187
1980 – 1989
- 1989
- [j67]Jon Louis Bentley, Frank Thomson Leighton, Margaret Lepley, Donald F. Stanat, J. Michael Steele:
A Randomized Data Structure for Ordered Sets. Adv. Comput. Res. 5: 413-428 (1989) - 1988
- [b2]Jon Louis Bentley:
More programming pearls - confessions of a coder. Addison-Wesley 1988, ISBN 978-0-201-11889-6, pp. I-VIII, 1-207 - [j66]Jon Louis Bentley, Brian W. Kernighan:
Tools for Printing Indexes. Electron. Publ. 1(1): 3-17 (1988) - [c12]Jon Louis Bentley:
Teaching the Tricks of the Trade. CSEE 1988: 1-8 - 1987
- [j65]Jon Louis Bentley:
Abstract Data Types. Commun. ACM 30(4): 284-290 (1987) - [j64]Jon Louis Bentley:
Self-Describing Data. Commun. ACM 30(6): 479-483 (1987) - [j63]Jon Louis Bentley:
A Sample of Brilliance. Commun. ACM 30(9): 754-757 (1987) - [j62]Jon Louis Bentley:
The Furbelow Memorandum. Commun. ACM 30(12): 998-999 (1987) - [j61]Jon Louis Bentley, Lynn W. Jelinski, Brian W. Kernighan:
Chem - a program for phototypesetting chemical structure diagrams. Comput. Chem. 11(4): 281-297 (1987) - [j60]Jon Louis Bentley, John A. Dallen:
Exercises in Software Design. IEEE Trans. Software Eng. 13(11): 1164-1169 (1987) - 1986
- [b1]Jon Louis Bentley:
Programming pearls. Addison-Wesley 1986, ISBN 978-0-201-10331-1, pp. I-VIII, 1-195 - [j59]Jon Louis Bentley:
Cutting the Gordian Knot. Commun. ACM 29(2): 92-96 (1986) - [j58]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) - [j57]Jon Louis Bentley:
Literate Programming. Commun. ACM 29(5): 364-369 (1986) - [j56]Jon Louis Bentley:
A Literate Program. Commun. ACM 29(6): 471-483 (1986) - [j55]Jon Louis Bentley:
Little Languages. Commun. ACM 29(8): 711-721 (1986) - [j54]Jon Louis Bentley, Brian W. Kernighan:
GRAP - A Language for Typesetting Graphs. Commun. ACM 29(8): 782-792 (1986) - [j53]Jon Louis Bentley:
Document Design. Commun. ACM 29(9): 832-839 (1986) - [j52]Jon Louis Bentley:
Birth of a Cruncher. Commun. ACM 29(12): 1155-1161 (1986) - 1985
- [j51]Jon Louis Bentley:
Tricks of the Trade. Commun. ACM 28(2): 138-141 (1985) - [j50]Jon Louis Bentley:
Thanks, Heaps. Commun. ACM 28(3): 245-250 (1985) - [j49]Jon Louis Bentley, Catherine C. McGeoch:
Amortized Analyses of Self-Organizing Sequential Search Heuristics. Commun. ACM 28(4): 404-411 (1985) - [j48]Jon Louis Bentley:
A Spelling Checker. Commun. ACM 28(5): 456-462 (1985) - [j47]Jon Louis Bentley:
Associative Arrays. Commun. ACM 28(6): 570-576 (1985) - [j46]Jon Louis Bentley:
Confessions of a Coder. Commun. ACM 28(7): 671-679 (1985) - [j45]Jon Louis Bentley:
Bumper-Sticker Computer Science. Commun. ACM 28(9): 896-901 (1985) - [j44]Jon Louis Bentley:
Selection. Commun. ACM 28(11): 1121-1127 (1985) - [c11]Jon Louis Bentley:
The role of performance in the software process. ISPW 1985: 113 - 1984
- [j43]Jon Louis Bentley:
Code Tuning. Commun. ACM 27(2): 91-96 (1984) - [j42]Jon Louis Bentley:
The Back of the Envelope. Commun. ACM 27(3): 180-184 (1984) - [j41]Jon Louis Bentley:
How to Sort. Commun. ACM 27(4): 287-291 (1984) - [j40]Jon Louis Bentley:
Squeezing Space. Commun. ACM 27(5): 416-421 (1984) - [j39]Jon Louis Bentley:
Graphic Output. Commun. ACM 27(6): 529-536 (1984) - [j38]Jon Louis Bentley:
Updates. Commun. ACM 27(7): 630-636 (1984) - [j37]Jon Louis Bentley:
Algorithm Design Techniques. Commun. ACM 27(9): 865-871 (1984) - [j36]Jon Louis Bentley:
Perspective on Performance. Commun. ACM 27(11): 1087-1092 (1984) - [j35]Jon Louis Bentley:
A Little Program, A Lot of Fun. Commun. ACM 27(12): 1179-1182 (1984) - [j34]Jon Louis Bentley:
A Case Study in Applied Algorithm Design. Computer 17(2): 75-88 (1984) - [c10]Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan:
Scaling and Related Techniques for Geometry Problems. STOC 1984: 135-143 - [c9]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 - 1983
- [j33]Jon Louis Bentley:
Cracking the Oyster. Commun. ACM 26(8): 549-552 (1983) - [j32]Jon Louis Bentley:
Aha! Algorithms. Commun. ACM 26(9): 623-628 (1983) - [j31]Jon Louis Bentley:
Data Structures Programs. Commun. ACM 26(10): 726-730 (1983) - [j30]Jon Louis Bentley:
Writing Correct Programs. Commun. ACM 26(12): 1040-1045 (1983) - 1982
- [j29]Jon Louis Bentley, Mark G. Faust, Franco P. Preparata:
Approximation Algorithms for Convex Hulls. Commun. ACM 25(1): 64-68 (1982) - [j28]Jon Louis Bentley, Donna J. Brown:
A General Class of Resource Tradeoffs. J. Comput. Syst. Sci. 25(2): 214-238 (1982) - 1981
- [c8]Jon Louis Bentley, Thomas Ottmann:
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. MFCS 1981: 1-15 - 1980
- [j27]Jon Louis Bentley, Hermann A. Maurer:
Efficient Worst-Case Data Structures for Range Searching. Acta Informatica 13: 155-168 (1980) - [j26]Jon Louis Bentley:
Multidimensional Divide-and-Conquer. Commun. ACM 23(4): 214-229 (1980) - [j25]Jon Louis Bentley:
A Parallel Algorithm for Constructing Minimum Spanning Trees. J. Algorithms 1(1): 51-59 (1980) - [j24]Jon Louis Bentley, James B. Saxe:
Decomposable Searching Problems I: Static-to-Dynamic Transformation. J. Algorithms 1(4): 301-358 (1980) - [j23]Jon Louis Bentley, Dorothea Haken, James B. Saxe:
A general method for solving divide-and-conquer recurrences. SIGACT News 12(3): 36-44 (1980) - [j22]Jon Louis Bentley, Derick Wood:
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. IEEE Trans. Computers 29(7): 571-577 (1980) - [j21]Jon Louis Bentley, James B. Saxe:
Generating Sorted Lists of Random Numbers. ACM Trans. Math. Softw. 6(3): 359-364 (1980) - [j20]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) - [j19]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) - [c7]Jon Louis Bentley, Donna J. Brown:
A General Class of Resource Tradeoffs (Extended Abstract). FOCS 1980: 217-228 - [c6]Christos H. Papadimitriou, Jon Louis Bentley:
A Worst-Case Analysis of Nearest Neighbor Searching by Projection. ICALP 1980: 470-482 - [c5]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 - [c4]Jon Louis Bentley, Thomas Ottmann:
The Power of a One-Dimensional Vector of Processors. WG 1980: 80-89
1970 – 1979
- 1979
- [j18]Jon Louis Bentley:
Introduction to Algorithm Design. Computer 12(2): 66-78 (1979) - [j17]Jon Louis Bentley, Jerome H. Friedman:
Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409 (1979) - [j16]Jon Louis Bentley, Hermann A. Maurer:
A Note on Euclidean Near Neighbor Searching in the Plane. Inf. Process. Lett. 8(3): 133-136 (1979) - [j15]Jon Louis Bentley:
Decomposable Searching Problems. Inf. Process. Lett. 8(5): 244-251 (1979) - [j14]Jon Louis Bentley, James B. Saxe:
Algorithms on vector sets. SIGACT News 11(2): 36-39 (1979) - [j13]Brian Ford, Jon Louis Bentley, J. J. Du Croz, Stephen J. Hague:
The NAG Library 'Machine'. Softw. Pract. Exp. 9(1): 65-72 (1979) - [j12]Jon Louis Bentley, Thomas Ottmann:
Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. Computers 28(9): 643-647 (1979) - [j11]Jon Louis Bentley:
Multidimensional Binary Search Trees in Database Applications. IEEE Trans. Software Eng. 5(4): 333-340 (1979) - [c3]James B. Saxe, Jon Louis Bentley:
Transforming Static Data Structures to Dynamic Structures (Abridged Version). FOCS 1979: 148-168 - 1978
- [j10]Jon Louis Bentley, Michael Ian Shamos:
Divide and Conquer for Linear Expected Time. Inf. Process. Lett. 7(2): 87-91 (1978) - [j9]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) - [j8]Jon Louis Bentley, Jerome H. Friedman:
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. IEEE Trans. Computers 27(2): 97-105 (1978) - 1977
- [j7]Jon Louis Bentley, Donald F. Stanat, E. Hollins Williams Jr.:
The Complexity of Finding Fixed-Radius Near Neighbors. Inf. Process. Lett. 6(6): 209-212 (1977) - [j6]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) - 1976
- [j5]Jon Louis Bentley, Walter A. Burkhard:
Heuristics for Partial-Match Retrieval Data Base Design. Inf. Process. Lett. 4(5): 132-135 (1976) - [j4]Jon Louis Bentley, Andrew Chi-Chih Yao:
An Almost Optimal Algorithm for Unbounded Searching. Inf. Process. Lett. 5(3): 82-87 (1976) - [c2]Jon Louis Bentley, Brian Ford:
On the Enhancement of Portability within the NAG Project - Statistical Survey. Portability of Numerical Software 1976: 505-528 - [c1]Jon Louis Bentley, Michael Ian Shamos:
Divide-and-Conquer in Multidimensional Space. STOC 1976: 220-230 - 1975
- [j3]Jon Louis Bentley:
Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517 (1975) - [j2]Jon Louis Bentley, Donald F. Stanat:
Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173 (1975) - 1974
- [j1]Raphael A. Finkel, Jon Louis Bentley:
Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Informatica 4: 1-9 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
