The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jon Louis Bentley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jon Louis Bentley
    Multidimensional Binary Search Trees Used for Associative Searching. [Citation Graph (92, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:9, pp:509-517 [Journal]
  2. Jon Louis Bentley, Jerome H. Friedman
    Data Structures for Range Searching. [Citation Graph (30, 0)][DBLP]
    ACM Comput. Surv., 1979, v:11, n:4, pp:397-409 [Journal]
  3. Raphael A. Finkel, Jon Louis Bentley
    Quad Trees: A Data Structure for Retrieval on Composite Keys [Citation Graph (29, 0)][DBLP]
    Acta Inf., 1974, v:4, n:, pp:1-9 [Journal]
  4. Jon Louis Bentley
    Multidimensional Binary Search Trees in Database Applications. [Citation Graph (25, 0)][DBLP]
    IEEE Trans. Software Eng., 1979, v:5, n:4, pp:333-340 [Journal]
  5. Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel
    An Algorithm for Finding Best Matches in Logarithmic Expected Time. [Citation Graph (17, 0)][DBLP]
    ACM Trans. Math. Softw., 1977, v:3, n:3, pp:209-226 [Journal]
  6. Jon Louis Bentley
    Multidimensional Divide-and-Conquer. [Citation Graph (8, 0)][DBLP]
    Commun. ACM, 1980, v:23, n:4, pp:214-229 [Journal]
  7. Jon Louis Bentley, Hermann A. Maurer
    Efficient Worst-Case Data Structures for Range Searching. [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:155-168 [Journal]
  8. Jon Louis Bentley, Thomas Ottmann
    Algorithms for Reporting and Counting Geometric Intersections. [Citation Graph (4, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:9, pp:643-647 [Journal]
  9. Jon Louis Bentley
    Algorithm Design Techniques. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:9, pp:865-871 [Journal]
  10. Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei
    A Locally Adaptive Data Compression Scheme. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:4, pp:320-330 [Journal]
  11. Jon Louis Bentley, Donald F. Stanat
    Analysis of Range Searches in Quad Trees. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Lett., 1975, v:3, n:6, pp:170-173 [Journal]
  12. Jon Louis Bentley, Bruce W. Weide, Andrew Chi-Chih Yao
    Optimal Expected-Time Algorithms for Closest Point Problems. [Citation Graph (2, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:4, pp:563-580 [Journal]
  13. James B. Saxe, Jon Louis Bentley
    Transforming Static Data Structures to Dynamic Structures (Abridged Version) [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:148-168 [Conf]
  14. Jon Louis Bentley, Robert Sedgewick
    Fast Algorithms for Sorting and Searching Strings. [Citation Graph (1, 0)][DBLP]
    SODA, 1997, pp:360-369 [Conf]
  15. Jon Louis Bentley
    Aha! Algorithms. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:9, pp:623-628 [Journal]
  16. Jon Louis Bentley
    Tricks of the Trade. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:2, pp:138-141 [Journal]
  17. Jon Louis Bentley
    A Spelling Checker. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:5, pp:456-462 [Journal]
  18. Jon Louis Bentley
    Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:5, pp:244-251 [Journal]
  19. Jon Louis Bentley, Donald F. Stanat, E. Hollings Williams Jr.
    The Complexity of Finding Fixed-Radius Near Neighbors. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:6, pp:209-212 [Journal]
  20. Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson
    On the Average Number of Maxima in a Set of Vectors and Applications. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1978, v:25, n:4, pp:536-543 [Journal]
  21. Jon Louis Bentley, James B. Saxe
    Decomposable Searching Problems I: Static-to-Dynamic Transformation. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:4, pp:301-358 [Journal]
  22. Jon Louis Bentley, Derick Wood
    An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1980, v:29, n:7, pp:571-577 [Journal]
  23. Jon Louis Bentley
    Experiments for Algorithm Engineering. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:3-4 [Conf]
  24. Jon Louis Bentley
    K-d Trees for Semidynamic Point Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:187-197 [Conf]
  25. Jon Louis Bentley
    Teaching the Tricks of the Trade. [Citation Graph (0, 0)][DBLP]
    CSEE, 1988, pp:1-8 [Conf]
  26. Jon Louis Bentley, M. Douglas McIlroy
    Data Compression Using Long Common Strings. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:287-295 [Conf]
  27. Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley
    Call Center Customer Verification by Query-Directed Passwords. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:54-67 [Conf]
  28. Jon Louis Bentley, Donna J. Brown
    A General Class of Resource Tradeoffs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:217-228 [Conf]
  29. Kiyoshi Sudo, Amit Bagga, Lawrence O'Gorman, Jon Louis Bentley
    Using Information Extraction for Quality Analysis in Human Authentication. [Citation Graph (0, 0)][DBLP]
    HICSS, 2005, pp:- [Conf]
  30. Jon Louis Bentley, Colin Mallows
    How Much Assurance Does a PIN Provide? [Citation Graph (0, 0)][DBLP]
    HIP, 2005, pp:111-126 [Conf]
  31. Christos H. Papadimitriou, Jon Louis Bentley
    A Worst-Case Analysis of Nearest Neighbor Searching by Projection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:470-482 [Conf]
  32. Sui-Yu Wang, Jon Louis Bentley
    CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images. [Citation Graph (0, 0)][DBLP]
    ICPR (3), 2006, pp:164-167 [Conf]
  33. Jon Louis Bentley, Thomas Ottmann
    The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:1-15 [Conf]
  34. Brian Ford, Jon Louis Bentley, J. J. Du Croz, Stephen J. Hague
    Preparing the NAG library. [Citation Graph (0, 0)][DBLP]
    Problems and Methodologies in Mathematical Software Production, 1980, pp:81-90 [Conf]
  35. Jon Louis Bentley, Brian Ford
    On the Enhancement of Portability within the NAG Project - Statistical Survey. [Citation Graph (0, 0)][DBLP]
    Portability of Numerical Software, 1976, pp:505-528 [Conf]
  36. Jon Louis Bentley
    Experiments on Traveling Salesman Heuristics. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:91-99 [Conf]
  37. Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
    Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:179-187 [Conf]
  38. Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
    Some Unexpected Expected Behavior Results for Bin Packing [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:279-288 [Conf]
  39. Jon Louis Bentley, Michael Ian Shamos
    Divide-and-Conquer in Multidimensional Space [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:220-230 [Conf]
  40. Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan
    Scaling and Related Techniques for Geometry Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:135-143 [Conf]
  41. Jon Louis Bentley
    Tiny Experiments for Algorithms and Life. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:182-182 [Conf]
  42. Jon Louis Bentley, Thomas Ottmann
    The Power of a One-Dimensional Vector of Processors. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:80-89 [Conf]
  43. Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
    Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:168-183 [Journal]
  44. Jon Louis Bentley
    Cracking the Oyster. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:8, pp:549-552 [Journal]
  45. Jon Louis Bentley
    Data Structures Programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:10, pp:726-730 [Journal]
  46. Jon Louis Bentley
    Writing Correct Programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:12, pp:1040-1045 [Journal]
  47. Jon Louis Bentley
    Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:30, n:4, pp:284-290 [Journal]
  48. Jon Louis Bentley
    Code Tuning. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:2, pp:91-96 [Journal]
  49. Jon Louis Bentley
    The Back of the Envelope. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:3, pp:180-184 [Journal]
  50. Jon Louis Bentley
    How to Sort. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:4, pp:287-291 [Journal]
  51. Jon Louis Bentley
    Squeezing Space. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:5, pp:416-421 [Journal]
  52. Jon Louis Bentley
    Graphic Output. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:6, pp:529-536 [Journal]
  53. Jon Louis Bentley
    Updates. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:7, pp:630-636 [Journal]
  54. Jon Louis Bentley
    Perspective on Performance. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:11, pp:1087-1092 [Journal]
  55. Jon Louis Bentley
    A Little Program, A Lot of Fun. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:12, pp:1179-1182 [Journal]
  56. Jon Louis Bentley
    Thanks, Heaps. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:3, pp:245-250 [Journal]
  57. Jon Louis Bentley
    Associative Arrays. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:6, pp:570-576 [Journal]
  58. Jon Louis Bentley
    Confessions of a Coder. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:7, pp:671-679 [Journal]
  59. Jon Louis Bentley
    Bumper-Sticker Computer Science. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:9, pp:896-901 [Journal]
  60. Jon Louis Bentley
    Selection. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:11, pp:1121-1127 [Journal]
  61. Jon Louis Bentley
    Cutting the Gordian Knot. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:2, pp:92-96 [Journal]
  62. Jon Louis Bentley
    Literate Programming. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:5, pp:364-369 [Journal]
  63. Jon Louis Bentley
    A Literate Program. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:6, pp:471-483 [Journal]
  64. Jon Louis Bentley
    Little Languages. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:8, pp:711-721 [Journal]
  65. Jon Louis Bentley
    Document Design. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:9, pp:832-839 [Journal]
  66. Jon Louis Bentley
    Birth of a Cruncher. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:12, pp:1155-1161 [Journal]
  67. Jon Louis Bentley
    Self-Describing Data. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:6, pp:479-483 [Journal]
  68. Jon Louis Bentley
    A Sample of Brilliance. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:9, pp:754-757 [Journal]
  69. Jon Louis Bentley
    The Furbelow Memorandum. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:12, pp:998-999 [Journal]
  70. Jon Louis Bentley, Mark G. Faust, Franco P. Preparata
    Approximation Algorithms for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1982, v:25, n:1, pp:64-68 [Journal]
  71. Jon Louis Bentley, Brian W. Kernighan
    GRAP - A Language for Typesetting Graphs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:8, pp:782-792 [Journal]
  72. Jon Louis Bentley, Catherine C. McGeoch
    Amortized Analyses of Self-Organizing Sequential Search Heuristics. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:4, pp:404-411 [Journal]
  73. Jon Louis Bentley, Lynn W. Jelinski, Brian W. Kernighan
    Chem - a program for phototypesetting chemical structure diagrams. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1987, v:11, n:4, pp:281-297 [Journal]
  74. Lawrence O'Gorman, Amit Bagga, Jon Louis Bentley
    Query-directed passwords. [Citation Graph (0, 0)][DBLP]
    Computers & Security, 2005, v:24, n:7, pp:546-560 [Journal]
  75. Jon Louis Bentley
    Introduction to Algorithm Design. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1979, v:12, n:2, pp:66-78 [Journal]
  76. Jon Louis Bentley, Brian W. Kernighan
    A System for Algorithm Animation. [Citation Graph (0, 0)][DBLP]
    Computing Systems, 1991, v:4, n:1, pp:5-30 [Journal]
  77. Jon Louis Bentley, Brian W. Kernighan
    Tools for Printing Indexes. [Citation Graph (0, 0)][DBLP]
    Electronic Publishing, 1988, v:1, n:1, pp:3-17 [Journal]
  78. Jon Louis Bentley, Walter A. Burkhard
    Heuristics for Partial-Match Retrieval Data Base Design. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:4, n:5, pp:132-135 [Journal]
  79. Jon Louis Bentley, Hermann A. Maurer
    A Note on Euclidean Near Neighbor Searching in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:3, pp:133-136 [Journal]
  80. Jon Louis Bentley, Michael Ian Shamos
    Divide and Conquer for Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:2, pp:87-91 [Journal]
  81. Jon Louis Bentley, Andrew Chi-Chih Yao
    An Almost Optimal Algorithm for Unbounded Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:3, pp:82-87 [Journal]
  82. Jon Louis Bentley, M. Douglas McIlroy
    Data compression with long repeated strings. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:135, n:1-2, pp:1-11 [Journal]
  83. Jon Louis Bentley
    A Parallel Algorithm for Constructing Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:1, pp:51-59 [Journal]
  84. Jon Louis Bentley, Donna J. Brown
    A General Class of Resource Tradeoffs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:2, pp:214-238 [Journal]
  85. Jon Louis Bentley
    Excerpt from Programming Pearls: The Back of the Envelope. [Citation Graph (0, 0)][DBLP]
    IEEE Software, 1999, v:16, n:5, pp:121-125 [Journal]
  86. Jon Louis Bentley, M. Douglas McIlroy
    Engineering a Sort Function. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1993, v:23, n:11, pp:1249-1265 [Journal]
  87. Brian Ford, Jon Louis Bentley, J. J. Du Croz, Stephen J. Hague
    The NAG Library 'Machine'. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1979, v:9, n:1, pp:65-72 [Journal]
  88. Jon Louis Bentley, Jerome H. Friedman
    Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:2, pp:97-105 [Journal]
  89. Jon Louis Bentley, James B. Saxe
    Generating Sorted Lists of Random Numbers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1980, v:6, n:3, pp:359-364 [Journal]
  90. Jon Louis Bentley, John A. Dallen
    Exercises in Software Design. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1987, v:13, n:11, pp:1164-1169 [Journal]
  91. Jon Louis Bentley, Mary Shaw
    An Alphard Specification of a Correct and Efficient Transformation on Data Structures. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1980, v:6, n:6, pp:572-584 [Journal]

  92. Implicit CAPTCHAs. [Citation Graph (, )][DBLP]


  93. In the realm of insight and creativity. [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.078secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002