Fast Scalable Construction of (Minimal Perfect Hash)
FunctionsMarco Genuzio1, Giuseppe Ottaviano2, and Sebastiano Vigna∗11Dipartimento di Informatica, Università degli Studi di Milano, Milan, Italy
2Facebook, Menlo Park, USAAbstractRecent advances in random linear systems on finite fields have paved the way for the
construction of constant-time data structures representing static functions and minimal
perfect hash functions using less space with respect to existing techniques. The main
obstructi
