World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
49
Citations
32754
World Ranking
5735
National Ranking
2605

Overview

Jon Louis Bentley is affiliated with Nokia in the United States. Their professional work is connected to this organization within the United States.

The available data does not list specific research papers, coauthors, publication venues, or fields of study associated with Jon Louis Bentley. Similarly, there is no information on topics of work, book publications, or awards received.

Despite the limited available data, the association with Nokia suggests involvement in areas related to telecommunications, technology, or software development, as these are core domains for the company. However, without explicit records, no detailed account of research contributions or expertise can be provided.

Best Publications

  • Multidimensional binary search trees used for associative searching

    Jon Louis Bentley

  • An Algorithm for Finding Best Matches in Logarithmic Expected Time

    Jerome H. Friedman;Jon Louis Bentley;Raphael Ari Finkel

  • Quad trees a data structure for retrieval on composite keys

    R. A. Finkel;J. L. Bentley

  • Multidimensional divide-and-conquer

    Jon Louis Bentley

  • Data Structures for Range Searching

    Jon Louis Bentley;Jerome H. Friedman

  • A locally adaptive data compression scheme

    Jon Louis Bentley;Daniel D. Sleator;Robert E. Tarjan;Victor K. Wei

  • Programming Pearls

    Jon Bentley;David Gries

  • Fast algorithms for sorting and searching strings

    Jon L. Bentley;Robert Sedgewick

  • Scaling and related techniques for geometry problems

    Harold N. Gabow;Jon Louis Bentley;Robert E. Tarjan

  • Multidimensional Binary Search Trees in Database Applications

    J.L. Bentley

  • Decomposable searching problems I. Static-to-dynamic transformation

    Jon Louis Bentley;James B Saxe

  • K-d trees for semidynamic point sets

    Jon Louis Bentley

  • On the Average Number of Maxima in a Set of Vectors and Applications

    J. L. Bentley;H. T. Kung;M. Schkolnick;C. D. Thompson

  • Optimal Expected-Time Algorithms for Closest Point Problems

    Jon Louis Bentley;Bruce W. Weide;Andrew C. Yao

  • Decomposable searching problems

    Jon Louis Bentley

  • An almost optimal algorithm for unbounded searching

    Jon Louis Bentley;Andrew Chi-Chih Yao

  • Programming pearls: the envelope is back

    Unknown

  • Programming pearls: algorithm design techniques

    Jon Bentley

  • Efficient worst-case data structures for range searching

    J. L. Bentley;H. A. Maurer

  • Engineering a sort function

    Jon L. Bentley;M. Douglas McIlroy

  • Programming pearls: a spelling checker

    Jon Bentley

  • An Algroithm for Finding Best Matches in Logarithmic Expected Time

    Jerome Friedman;Jon L Bentley;Raphael A Finkel

Frequent Co-Authors

Brian W. Kernighan
Brian W. Kernighan Princeton University
Jerome H. Friedman
Jerome H. Friedman Stanford University
Andrew Chi-Chih Yao
Andrew Chi-Chih Yao Tsinghua University
Kenneth L. Clarkson
Kenneth L. Clarkson IBM (United States)
David Gries
David Gries Cornell University
Franco P. Preparata
Franco P. Preparata Brown University
Robert E. Tarjan
Robert E. Tarjan Princeton University
Mary Shaw
Mary Shaw Carnegie Mellon University
Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
David S. Johnson
David S. Johnson AT&T (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

If you’re considering a Computer Science degree in the USA, there are many flexible options to explore your interests and meet your academic needs. Prospective students who may not meet traditional admission requirements can still pursue their goals through online graduate schools with low gpa requirements. These programs often offer additional support and multiple start dates.

For those looking to expedite their education, enrolling in a 1 year computer science degree online is an efficient way to enter the workforce quickly or transition to a new tech career. Accelerated programs provide the same rigorous curriculum as traditional degrees but in a condensed format.

Interdisciplinary opportunities are also available. Many students interested in technology and sustainability pursue pathways like environmental science or engineering. Wondering what can you do with an environmental science degree? These programs open doors in research, policy, and green technology.

If affordability is a concern, look for the most affordable online environmental engineering degree programs. These options are great for students who want a valuable education without the high price tag, all while studying remotely.

Best Scientists Citing Jon Louis Bentley

Recently Published Articles