Universal hash functions for an infinite universe and hash trees

DOI10.1016/J.IPL.2008.12.012MaRDI QIDQ987792zbMATH OpenOpenAlexFDO

Authors Peter Brass

Publication date 16 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.12.012

zbMATH Keywords

data structureshash tablesextendible hashinguniversal hash functionshash trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Construction of universal one-way hash functions: tree hashing revisited
• Uniform Hashing in Constant Time and Optimal Space
• Combinatorial techniques for universal hashing
• scientific article; zbMATH DE number 176541
• scientific article; zbMATH DE number 177800

Cites work

• scientific article; zbMATH DE number 1156718 (Why is no real title available?)
• A caution on universal classes of hash functions
• Dynamic hashing
• File structures using hashing functions
• Hashing functions
• Indexed extendible hashing
• Universal classes of hash functions

Cited in

(4)

• A reciprocal confluence tree unit and its applications
• Hash Trees Versus B-Trees
• The computational complexity of universal hashing
• Sakura: a flexible coding for tree hashing

This page was built for publication: Universal hash functions for an infinite universe and hash trees

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