Hash, Displace, and Compress

DOI10.1007/978-3-642-04128-0_61zbMath1256.68046OpenAlexW62638829WikidataQ56021019 ScholiaQ56021019MaRDI QIDQ3639281

Fabiano C. Botelho, Djamal Belazzougui, Martin Dietzfelbinger

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_61

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

Minimal and Monotone Minimal Perfect Hash Functions ⋮ Flash memory efficient LTL model checking ⋮ SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Unnamed Item ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: Hash, Displace, and Compress