Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Open addressing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the… Expand
2005
2005
Hardware innovations such as motes, RFIDs, embedded microprocessors, and wireless sensors, have provided the foundation for a… Expand
Highly Cited
2005
Highly Cited
2005
We present the first non-blocking hashtable based on open addressing that provides the following benefits: it combines good cache… Expand
Highly Cited
2004
Highly Cited
2004
Abstract.We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises… Expand
1990
1990
This paper gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby… Expand
1990
1990
A new approach to the analysis of random probing hashing algorithms is presented. The probability-generating function in closed… Expand
1988
1988
Two simple methods for collision resolution in open addressing hashing are First-Come-First-Served (FCFS) and Last-Come-First… Expand
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… Expand
1980
1980
When analyzing hashing algorithms, it is usually assumed that all keys in the table are equally likely to be accessed. In… Expand
1975
1975
In this paper procedures are studied for storing, accessing, updating, and reorganizing data in large files whose organization is… Expand
