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

Open addressing

Known as: Closed hashing, Open address hash table, Open adressing 
Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or… Expand
Wikipedia

Related topics

Related topics

13 relations
C++11Coalesced hashingCuckoo hashingDouble hashing
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Over-policed? Tackling incivilities and effects of adressing uncivil behaviour through punitive law
 
Is this relevant?
2008
2008
PID Controller Synthesis with Specifed Stability Requirement for Some Classes of MIMO Systems
For certain classes of linear, timeinvariant, multi-input multi-output plants, a systematic synthesis method is developed for… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Non-blocking Hashtables with Open Addressing
We present the first non-blocking hashtable based on open addressing that provides the following benefits: it combines good cache… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
Lock-free dynamic hash tables with open addressing
Abstract.We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises… Expand
Is this relevant?
2004
2004
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by… Expand
Is this relevant?
1989
1989
On aspects of university and performance for closed hashing
We consider two hashing models for storing a set <italic>S</italic> ⊂ {0, 1, 2, …, <italic>m</italic> - 1} in a table <italic>T… Expand
Is this relevant?
1988
1988
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing
Two simple methods for collision resolution in open addressing hashing are First-Come-First-Served (FCFS) and Last-Come-First… Expand
Is this relevant?
1981
1981
Computed chaining - A hybrid of direct chaining and open addressing
Abstract Several popular methods for resolving hashing collisions currently exist: direct chaining, open addressing and… Expand
Is this relevant?
1980
1980
Open-Addressing Hashing with Unequal-Probability Keys
When analyzing hashing algorithms, it is usually assumed that all keys in the table are equally likely to be accessed. In… Expand
  • table I
  • table 1
  • table II
Is this relevant?
1963
1963
Notes on "open" addressing
Apparatus for measuring rocket motor thrust components and resolving small vector alignment errors. Apparatus includes a… Expand
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