Jon Louis Bentley mostly deals with Data structure, Theoretical computer science, Algorithm, Nearest neighbor search and k-d tree. His Data structure study integrates concerns from other disciplines, such as Pseudocode, Computer programming, Debugging and Data mining. His research integrates issues of Interval tree, Search tree, Ternary search tree, Logarithm and Range in his study of Theoretical computer science.
His Algorithm research is multidisciplinary, incorporating elements of Transformation, Algebra, Scheme and Combinatorial model. Jon Louis Bentley has included themes like Voronoi diagram and k-nearest neighbors algorithm in his Nearest neighbor search study. His Range tree research incorporates themes from Discrete mathematics, Fusion tree, Self-balancing binary search tree, Cartesian tree and Treap.
Theoretical computer science, Algorithm, Data structure, Programming language and Algorithm design are his primary areas of study. In his works, Jon Louis Bentley performs multidisciplinary study on Theoretical computer science and Very-large-scale integration. His work in Algorithm addresses issues such as Logarithm, which are connected to fields such as Theory of computation.
His biological study spans a wide range of topics, including Range, Correctness, Data mining and Computation. His work on Programmer as part of general Programming language study is frequently linked to GRAP, Disk formatting and troff, bridging the gap between disciplines. The Algorithm design study combines topics in areas such as Field and Upper and lower bounds.
Jon Louis Bentley mainly focuses on Theoretical computer science, Algorithm, Algorithm design, Data compression and Algorithm animation. His Theoretical computer science research is multidisciplinary, relying on both Sorting, Quicksort and Graph. His work deals with themes such as Asymptotic computational complexity and Probabilistic analysis of algorithms, which intersect with Algorithm.
His Algorithm design study deals with Upper and lower bounds intersecting with Discrete mathematics, Probability distribution and Scalar. The study incorporates disciplines such as Scheme, Software system and Data file in addition to Data compression. His research integrates issues of Programming language, Set and Sorting algorithm in his study of Animation.
Jon Louis Bentley focuses on Combinatorics, Sorting algorithm, Dutch national flag problem, Quicksort and Sorting. Jon Louis Bentley combines subjects such as Range tree, Nearest neighbor search and k-d tree with his study of Combinatorics. Jon Louis Bentley merges Nearest neighbor search with Cover tree in his study.
His Sorting algorithm study combines topics in areas such as Algorithm design and Theoretical computer science.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Multidimensional binary search trees used for associative searching
Jon Louis Bentley.
Communications of The ACM (1975)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Jerome H. Friedman;Jon Louis Bentley;Raphael Ari Finkel.
ACM Transactions on Mathematical Software (1977)
Quad trees a data structure for retrieval on composite keys
R. A. Finkel;J. L. Bentley.
Acta Informatica (1974)
Jon Louis Bentley.
Communications of The ACM (1980)
Data Structures for Range Searching
Jon Louis Bentley;Jerome H. Friedman.
ACM Computing Surveys (1979)
A locally adaptive data compression scheme
Jon Louis Bentley;Daniel D. Sleator;Robert E. Tarjan;Victor K. Wei.
Communications of The ACM (1986)
Jon Bentley;David Gries.
Multidimensional Binary Search Trees in Database Applications
IEEE Transactions on Software Engineering (1979)
Decomposable searching problems I. Static-to-dynamic transformation
Jon Louis Bentley;James B Saxe.
Journal of Algorithms (1980)
On the Average Number of Maxima in a Set of Vectors and Applications
J. L. Bentley;H. T. Kung;M. Schkolnick;C. D. Thompson.
Journal of the ACM (1978)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: