The following pages link to Jon Louis Bentley (Q1134521):
Displayed 40 items.
- Multidimensional divide-and-conquer (Q148390) (← links)
- (Q205196) (redirect page) (← links)
- Efficient worst-case data structures for range searching (Q1134522) (← links)
- (Q1206438) (redirect page) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Analysis of range searches in quad trees (Q1216951) (← links)
- Heuristics for partial-match retrieval data base design (Q1223153) (← links)
- An almost optimal algorithm for unbounded searching (Q1229581) (← links)
- The complexity of finding fixed-radius near neighbors (Q1244819) (← links)
- A note on Euclidean near neighbor searching in the plane (Q1253102) (← links)
- Divide and conquer for linear expected time (Q1256853) (← links)
- Decomposable searching problems (Q1256856) (← links)
- Quad trees: A data structure for retrieval by composite keys (Q1394116) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- Algorithms for Reporting and Counting Geometric Intersections (Q3049855) (← links)
- (Q3138882) (← links)
- (Q3138891) (← links)
- (Q3666231) (← links)
- (Q3783526) (← links)
- Generating Sorted Lists of Random Numbers (Q3875190) (← links)
- A parallel algorithm for constructing minimum spanning trees (Q3875355) (← links)
- Optimal Expected-Time Algorithms for Closest Point Problems (Q3883531) (← links)
- (Q3886873) (← links)
- An Alphard Specification of a Correct and Efficient Transformation on Data Structures (Q3891744) (← links)
- (Q3898031) (← links)
- Decomposable searching problems I. Static-to-dynamic transformation (Q3911409) (← links)
- (Q3911419) (← links)
- Approximation algorithms for convex hulls (Q3919102) (← links)
- (Q3933766) (← links)
- (Q3992623) (← links)
- Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311) (← links)
- Multidimensional binary search trees used for associative searching (Q4062679) (← links)
- An Algorithm for Finding Best Matches in Logarithmic Expected Time (Q4139672) (← links)
- (Q4140384) (← links)
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces (Q4146251) (← links)
- On the Average Number of Maxima in a Set of Vectors and Applications (Q4170249) (← links)
- Multidimensional Binary Search Trees in Database Applications (Q4198073) (← links)
- Template-driven interfaces for numerical subroutines (Q4371539) (← links)
- (Q5501814) (← links)
- Data compression with long repeated strings (Q5944433) (← links)