Share This Author
Multidimensional binary search trees used for associative searching
- J. Bentley
- Computer ScienceCACM
- 1 September 1975
TLDR
An Algorithm for Finding Best Matches in Logarithmic Expected Time
- J. Friedman, J. Bentley, R. Finkel
- Computer ScienceTOMS
- 1 July 1976
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.…
Quad trees a data structure for retrieval on composite keys
- R. Finkel, J. Bentley
- Computer ScienceActa Informatica
- 1 March 1974
TLDR
Algorithms for Reporting and Counting Geometric Intersections
- J. Bentley, T. Ottmann
- Computer Science, MathematicsIEEE Transactions on Computers
- 1 September 1979
TLDR
Scaling and related techniques for geometry problems
- H. Gabow, J. Bentley, R. Tarjan
- PhysicsSTOC '84
- 1 December 1984
TLDR
Multidimensional divide-and-conquer
- J. Bentley
- Computer ScienceCACM
- 1 April 1980
TLDR
Fast algorithms for sorting and searching strings
- J. Bentley, R. Sedgewick
- Computer ScienceSODA '97
- 5 January 1997
TLDR
K-d trees for semidynamic point sets
- J. Bentley
- PhysicsSCG '90
- 1 May 1990
TLDR
Decomposable Searching Problems
- J. Bentley
- Computer ScienceInf. Process. Lett.
- 11 June 1979
A locally adaptive data compression scheme
- J. Bentley, D. Sleator, R. Tarjan, V. K. Wei
- Computer ScienceCACM
- 1 April 1986
TLDR
...
...