A dictionary implementation based on dynamic perfect hashing

DOI10.1145/1227161.1370602MaRDI QIDQ5269281zbMATH OpenOpenAlexFDO

Authors Martin Dietzfelbinger, Martin Hühne, Christoph Weidling

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227161.1370602

zbMATH Keywords

data structuresdictionariesdynamic hashinghash functionsimplementation

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms (68W40)

Recommendations

• Dynamic Perfect Hashing: Upper and Lower Bounds
• De Dictionariis Dynamicis Pauco Spatio Utentibus
• scientific article; zbMATH DE number 1875412
• Cuckoo hashing
• Quasi-perfect Hashing

Cited in

(8)

• The complexity of hashing with lazy deletion
• Dictionaries using variable-length keys and data, with applications
• scientific article; zbMATH DE number 4209577 (Why is no real title available?)
• De Dictionariis Dynamicis Pauco Spatio Utentibus
• Large-Scale Data Dictionaries Based on Hash Tables
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Cuckoo hashing
• scientific article; zbMATH DE number 1875412 (Why is no real title available?)

This page was built for publication: A dictionary implementation based on dynamic perfect hashing

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