An extendable data structure for incremental stable perfect hashing

DOI10.1145/3519935.3520070MaRDI QIDQ6083584zbMATH OpenFDO

Authors Guy Even

Publication date 8 December 2023

Published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

dictionaryextendable data structurefilterperfect hashingsuccint data structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• An approximate analysis of the performance of extendible hashing with elastic buckets
• Phorma: perfectly hashable order restricted multidimensional arrays
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• scientific article; zbMATH DE number 1857513 (Why is no real title available?)
• Daisy Bloom filters

This page was built for publication: An extendable data structure for incremental stable perfect hashing

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