Last-come-first-served hashing

DOI10.1016/0196-6774(89)90014-XMaRDI QIDQ4203805zbMATH OpenFDO

Authors Patricio V. Poblete, J. Ian Munro

Publication date 1989

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(89)90014-X

zbMATH Keywords

hashingopen addressing

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cache-oblivious hashing
• Optimal hashing
• scientific article; zbMATH DE number 2065606
• Hashing, load balancing and multiple choice
• Quasi-perfect Hashing
• Hash functions for priority queues
• Hopscotch Hashing
• Consistent hashing with bounded loads

Cited in

(9)

• Linear open addressing and Peterson's theorem rehashed
• The effect of deletions on different insertion disciplines for hash tables
• A unified approach to linear probing hashing with buckets
• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
• scientific article; zbMATH DE number 4045254 (Why is no real title available?)
• scientific article; zbMATH DE number 4062573 (Why is no real title available?)
• The maximum displacement for linear probing hashing
• Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions
• DOUBLE HASHING WITH MULTIPLE PASSBITS

This page was built for publication: Last-come-first-served hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203805)