Roberto Trani

most citedPTHash: Revisiting FCH Minimal Perfect Hashing

32 citations · 32 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DS2021

Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash

Giulio Ermanno Pibiri, Roberto Trani

A function $f : U \to {0, \dots, n - 1}$ is a minimal perfect hash function for a set $S \subseteq U$ of size $n$ , if $f$ bijectively maps $S$ into the first $n$ natural numbers. Th…

cs.DS2021★ 32 cited

PTHash: Revisiting FCH Minimal Perfect Hashing

Giulio Ermanno Pibiri, Roberto Trani

Given a set $S$ of $n$ distinct keys, a function $f$ that bijectively maps the keys of $S$ into the range ${0, \dots, n - 1}$ is called a minimal perfect hash function for $S$ . Algo…