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â€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2018

Review

2018

- Rosa M. JimÃ©nez, Conrado MartÃnez
- ANALCO
- 2018

Deletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark â€™deletedâ€™ soâ€¦Â (More)

Is this relevant?

2005

2005

- Chris Purcell, Timothy L. Harris
- DISC
- 2005

We present the first non-blocking hashtable based on open addressing that provides the following benefits: it combines good cacheâ€¦Â (More)

Is this relevant?

2004

2004

- Hui Gao, Jan Friso Groote, Wim H. Hesselink
- Distributed Computing
- 2004

We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises more robustâ€¦Â (More)

Is this relevant?

2003

2003

- Wenbin Luo, Gregory L. Heileman
- Computers and Their Applications
- 2003

In [1], we showed that different open addressing hash functions perform differently when the data elements are not uniformlyâ€¦Â (More)

Is this relevant?

2003

2003

- Wenbin Luo, Gregory L. Heileman
- Computers and Their Applications
- 2003

Hash functions are among the oldest and most widely used data structures in computer science. Different hash functions exist. Soâ€¦Â (More)

Is this relevant?

1989

1989

- Jeanette P. Schmidt, Alan Siegel
- STOC
- 1989

We consider two hashing models for storing a set <italic>S</italic> âŠ‚ {0, 1, 2, â€¦, <italic>m</italic> - 1} in a table <italic>Tâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Gaston H. Gonnet
- J. ACM
- 1981

An investigation ts made o f the expected value o f the m a x i m u m number of accesses needed to locate any element m a hashingâ€¦Â (More)

Is this relevant?

1980

1980

- Gaston H. Gonnet
- J. Comput. Syst. Sci.
- 1980

When analyzing hashing algorithms, it is usually assumed that all keys in the table are equally likely to be accessed. Inâ€¦Â (More)

Is this relevant?

1973

1973

- Jan A. van der Pool
- IBM Journal of Research and Development
- 1973

File organizations utilizing key-to-address transformation and open addressing are studied. A simulation method and a Markovâ€¦Â (More)

Is this relevant?

1963

1963

- M. Tainiter
- J. ACM
- 1963

Search-time probabilities are obtained for records stored in a random-access storage. Each bucket of the storage has an n-recordâ€¦Â (More)

Is this relevant?