Linear probing

Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2018
010203019712018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms for storing (key,value) pairs. In… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present KenLM, a library that implements two data structures for efficient language model queries, reducing both time and… (More)
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Is this relevant?
2010
2010
Previously [SODA’04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2009
2009
Linear probing is one of the most popular implementations of dynamic hash tables storing all keys in a single array. When we get… (More)
Is this relevant?
2007
2007
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paperdescribes an algorithm designed to minimally reconfigure schedulesin response to a changing environment. External… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1998
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under… (More)
Is this relevant?
1985
1985
Linear hashing is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1984
1984
An algorithm is developed which reduces the memory requirements of hash tables. This is achieved by storing only a part of each… (More)
  • figure 1
  • figure 3
  • table I
  • table III
  • table II
Is this relevant?