Uniform deterministic dictionaries

DOI10.1145/1328911.1328912zbMath1445.68073OpenAlexW2109089989MaRDI QIDQ4962693

Milan Ruzic

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

deterministic algorithmsperfect hashing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (5)

Time-Space Trade-Offs for Longest Common Extensions ⋮ Construct a perfect word hash function in time independent of the size of integers ⋮ Unnamed Item ⋮ Time-space trade-offs for longest common extensions ⋮ Optimal Las Vegas reduction from one-way set reconciliation to error correction

This page was built for publication: Uniform deterministic dictionaries