Simple tabulation, fast expanders, double tabulation, and high independence

DOI10.1109/FOCS.2013.18MaRDI QIDQ6981767zbMATH OpenFDO

Authors Mikkel Thorup

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.18

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• Succinct filters for sets of unknown sizes

This page was built for publication: Simple tabulation, fast expanders, double tabulation, and high independence

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