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

Hash table

Known as: Hashtable, Rehash, Hash table collisions 
In computing, a hash table (hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Online 3D reconstruction is gaining newfound interest due to the availability of real-time consumer depth cameras. The basic… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2010
Highly Cited
2010
Alternative vehicles, such as plug-in hybrid electric vehicles, are becoming more popular. The batteries of these plug-in hybrid… Expand
  • figure 1
  • figure 3
  • figure 2
  • table I
  • table II
Highly Cited
2008
Highly Cited
2008
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores <i>n</i> elements… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2004
Highly Cited
2004
Abstract We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that… Expand
  • figure 1
  • figure 2
Highly Cited
2004
Highly Cited
2004
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2003
Highly Cited
2003
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Highly Cited
2003
Highly Cited
2003
Making effective use of the vast amounts of data gathered by large-scale sensor networks (sensornets) will require scalable, self… Expand
  • figure 3
  • figure 5
  • figure 4
  • table 1
  • table 2
Highly Cited
2002
Highly Cited
2002
Making effective use of the vast amounts of data gathered by large-scale sensor networks will require scalable, self-organizing… Expand
  • figure 3
  • figure 1
  • figure 4
  • figure 7
  • table 2
Highly Cited
2002
Highly Cited
2002
Lock-free (non-blocking) shared data structures promise more robust performance and reliability than conventional lock-based… Expand
  • figure 1
  • figure 6
  • figure 4
  • figure 7
  • figure 8
Highly Cited
1979
Highly Cited
1979
Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7