Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 212,383,094 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
C++11
Coalesced hashing
Cuckoo hashing
Double hashing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Minimal perfect hashing: A competitive method for indexing internal memory
Fabiano C. Botelho
,
A. Lacerda
,
G. Menezes
,
N. Ziviani
Information Sciences
2011
Corpus ID: 45400121
2005
2005
Tridirectional computed chaining: an efficient hashing algorithm for limited space applications
M. Loeb
,
A. L. Tharp
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…
Expand
2005
2005
Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks
M. Mitzenmacher
International Symposium on Distributed Computing
2005
Corpus ID: 40764484
We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the…
Expand
2004
2004
Comparison of Hash Table Verses Lexical Transducer Based Implementations of Urdu Lexicon
S.M. Jafar Rizvi
,
M. Hussain
,
N. Qaiser
Student Conference On Engineering, Sciences and…
2004
Corpus ID: 45578661
Lexicon is the base for many natural language processing applications. This paper describes and compares the approaches for the…
Expand
Highly Cited
2003
Highly Cited
2003
Cuckoo hashing: Further analysis
L. Devroye
,
Pat Morin
Information Processing Letters
2003
Corpus ID: 8550734
Highly Cited
1997
Highly Cited
1997
Perfect Hashing
Z. Czech
,
G. Havas
,
B. Majewski
Theoretical Computer Science
1997
Corpus ID: 14809018
Highly Cited
1995
Highly Cited
1995
An introduction to the analysis of algorithms
R. Sedgewick
,
P. Flajolet
1995
Corpus ID: 14661321
1. Analysis of Algorithms. Why Analyze an Algorithm? Computational Complexity. Analysis of Algorithms. Average-Case Analysis…
Expand
1995
1995
Data structures, algorithms, and software principles in C
T. Standish
1995
Corpus ID: 12098456
Using C, this book develops the concepts and theory of data structures and algorithm analysis step by step, proceeding from…
Expand
1990
1990
The analysis of closed hashing under limited randomness
Jeanette P. Schmidt
,
A. Siegel
Symposium on the Theory of Computing
1990
Corpus ID: 1243226
This paper gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby…
Expand
Highly Cited
1981
Highly Cited
1981
Trie hashing
W. Litwin
ACM SIGMOD Conference
1981
Corpus ID: 14846281
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE