| Multidimensional binary search trees used for associative searching JL Bentley Communications of the ACM 18 (9), 509-517, 1975 | 10391 | 1975 |
| An algorithm for finding best matches in logarithmic expected time JH Friedman, JL Bentley, RA Finkel ACM Transactions on Mathematical Software (TOMS) 3 (3), 209-226, 1977 | 4182 | 1977 |
| Quad trees a data structure for retrieval on composite keys RA Finkel, JL Bentley Acta informatica 4, 1-9, 1974 | 3091 | 1974 |
| Algorithms for reporting and counting geometric intersections JL Bentley, T Ottmann IEEE Transactions on computers 100 (9), 643-647, 1979 | 1522 | 1979 |
| Multidimensional divide-and-conquer JL Bentley Communications of the ACM 23 (4), 214-229, 1980 | 1047 | 1980 |
| Data structures for range searching JL Bentley, JH Friedman ACM Computing Surveys (CSUR) 11 (4), 397-409, 1979 | 1012 | 1979 |
| Programming pearls: literate programming J Bentley, D Knuth Communications of the ACM 29 (5), 384-369, 1986 | 898 | 1986 |
| A locally adaptive data compression scheme JL Bentley, DD Sleator, RE Tarjan, VK Wei Communications of the ACM 29 (4), 320-330, 1986 | 777 | 1986 |
| Fast algorithms for geometric traveling salesman problems JL Bentley ORSA Journal on computing 4 (4), 387-411, 1992 | 717 | 1992 |
| Multidimensional binary search trees in database applications JL Bentley IEEE Transactions on Software Engineering, 333-340, 1979 | 659 | 1979 |
| Scaling and related techniques for geometry problems HN Gabow, JL Bentley, RE Tarjan Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 640 | 1984 |
| Fast algorithms for sorting and searching strings JL Bentley, R Sedgewick Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms …, 1997 | 613 | 1997 |
| K-d trees for semidynamic point sets JL Bentley Proceedings of the sixth annual symposium on Computational geometry, 187-197, 1990 | 580 | 1990 |
| Programming pearls: little languages J Bentley Communications of the ACM 29 (8), 711-721, 1986 | 543* | 1986 |
| Decomposable searching problems I. Static-to-dynamic transformation JL Bentley, JB Saxe Journal of Algorithms 1 (4), 301-358, 1980 | 518 | 1980 |
| Decomposable searching problems. JL Bentley, JB Saxe Carnegie Mellon University, 1978 | 515 | 1978 |
| On the average number of maxima in a set of vectors and applications JL Bentley, HT Kung, M Schkolnick, CD Thompson Journal of the ACM (JACM) 25 (4), 536-543, 1978 | 496 | 1978 |
| Optimal expected-time algorithms for closest point problems JL Bentley, BW Weide, AC Yao ACM Transactions on Mathematical Software (TOMS) 6 (4), 563-580, 1980 | 462 | 1980 |
| An almost optimal algorithm for unbounded searching JL Bentley, ACC Yao Information processing letters 5 (SLAC-PUB-1679), 1976 | 410 | 1976 |
| An optimal worst case algorithm for reporting intersections of rectangles JL Bentley, D Wood IEEE Transactions on Computers 100 (7), 571-577, 1980 | 362 | 1980 |
Jerome FriedmanVerified email at stanford.edu
