Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Interpolation search

Known as: Extrapolation search 
Interpolation search is an algorithm for searching for a given key in an indexed array that has been ordered by numerical values assigned to the keys… Expand
Wikipedia

Related topics

Related topics

14 relations
AlgorithmB-treeBinary search algorithmC++
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
KenLM: Faster and Smaller Language Model Queries
We present KenLM, a library that implements two data structures for efficient language model queries, reducing both time and… Expand
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The influence of interpolation and station network density on the distributions and trends of climate variables in gridded daily data
We study the influence of station network density on the distributions and trends in indices of area-average daily precipitation… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP… Expand
Is this relevant?
2006
2006
Dynamic Interpolation Search Revisited
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(loglogn) search time with high probability on… Expand
Is this relevant?
2004
2004
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search… Expand
Is this relevant?
1993
1993
Dynamic Interpolation Search in o(log log n) Time
A new efficient data structure, based on the augmentation technique used in the interpolation search tree by Mehlhorn and… Expand
  • figure 2
  • table 1
Is this relevant?
1990
1990
Fast Updating of Well-Balanced Trees
We focus on the problem of maintaining binary search trees with an optimal and near-optimal number of incomplete levels. For a… Expand
  • figure 1
  • figure 2
Is this relevant?
1985
1985
Dynamic Interpolation Search
We present a new data structure called Interpolation Search tree (IST) which supports interpolation search and insertions and… Expand
Is this relevant?
1979
1979
Efficient Ordering of Hash Tables
We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new… Expand
  • figure 1
  • table 2
  • table 3
  • figure 2
  • table 4
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Interpolation search—a log logN search
Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the… Expand
  • table 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE