Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
  • M. Loeb, A. L. Tharp
  • 29th Annual International Computer Software and…
  • 2005
  • Corpus ID: 27218129
Hardware innovations such as motes, RFIDs, embedded microprocessors, and wireless sensors, have provided the foundation for a… 
2005
2005
We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the… 
Highly Cited
2003
Highly Cited
2003
1995
1995
Using C, this book develops the concepts and theory of data structures and algorithm analysis step by step, proceeding from… 
Highly Cited
1995
Highly Cited
1995
1. Analysis of Algorithms. Why Analyze an Algorithm? Computational Complexity. Analysis of Algorithms. Average-Case Analysis… 
1990
1990
This paper gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby… 
Highly Cited
1981
Highly Cited
1981
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file… 
1975
1975
In this paper procedures are studied for storing, accessing, updating, and reorganizing data in large files whose organization is…