Ordered hash tables

DOI10.1093/COMJNL/17.2.135MaRDI QIDQ4768616zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ole Amble, Donald E. Knuth

Publication date 1974

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/17.2.135

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20)

Cited in

(13)

• Double hashing with passbits
• Linear open addressing and Peterson's theorem rehashed
• Algorithms for a hashed file with variable-length records
• A unified approach to linear probing hashing with buckets
• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
• The table look-up rule
• In-place linear probing sort
• Engineering practical Lempel-Ziv tries
• Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions
• DOUBLE HASHING WITH MULTIPLE PASSBITS
• Towards an analysis of quadratic probing
• Online list labeling: breaking the ^2n barrier
• History-independent concurrent objects

This page was built for publication: Ordered hash tables

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