Applications of a Splitting Trick

DOI10.1007/978-3-642-02927-1_30MaRDI QIDQ3638047zbMATH OpenOpenAlexFDO

Authors Martin Dietzfelbinger, Michael Rink

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_30

Mathematics Subject Classification ID

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

Recommendations

• Almost random graphs with simple hash functions
• Pseudorandom Graphs in Data Structures
• scientific article; zbMATH DE number 6351507

Cited in

(11)

• Balanced allocation and dictionaries with tightly packed constant size bins
• scientific article; zbMATH DE number 5560390 (Why is no real title available?)
• Almost free splitters
• scientific article; zbMATH DE number 7525476 (Why is no real title available?)
• Dynamic dictionaries for multisets and counting filters with constant time operations
• Tiny pointers
• ShockHash: near optimal-space minimal perfect hashing beyond brute-force
• Ribbon: fast succinct static retrieval and approximate membership
• Invertible Bloom lookup tables with less memory and randomness
• Combined search and encoding for seeds, with an application to minimal perfect hashing
• Dynamic dictionaries for multisets and counting filters with constant time operations

This page was built for publication: Applications of a Splitting Trick

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