Ordered hash tables

DOI10.1093/comjnl/17.2.135zbMath0282.68009OpenAlexW2151454836WikidataQ56049301 ScholiaQ56049301MaRDI QIDQ4768616

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

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

Related Items (10)

A unified approach to linear probing hashing with buckets ⋮ Linear open addressing and Peterson's theorem rehashed ⋮ In-place linear probing sort ⋮ Engineering Practical Lempel-Ziv Tries ⋮ DOUBLE HASHING WITH MULTIPLE PASSBITS ⋮ Algorithms for a hashed file with variable-length records ⋮ The table look-up rule ⋮ The Diagonal Poisson Transform and its application to the analysis of a hashing scheme ⋮ Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions ⋮ Double hashing with passbits

This page was built for publication: Ordered hash tables