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

Dynamic perfect hashing

In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.While more memory… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2008
2008
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic… Expand
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
2008
2008
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is dynamic perfect… Expand
Is this relevant?
2007
2007
We present a strongly history independent (SHI) hash table that supports search in O(l) worst-case time, and insert and delete in… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the problem of maintaining a dynamic set of integers and answering queries of the form: report a point (equivalently… Expand
  • figure 1
Is this relevant?
2005
2005
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Let u, m≥1 be arbitrary integers and let k≥u. The central result of this paper is that the multiset H={itha,b¦0≤a, b<km} of… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A randomized algorithm is given for the dictionary problem with O(1) worst-case time for lookup and O(1) amortized expected time… Expand
Is this relevant?