Monotone minimal perfect hashing: searching a sorted table with <i>O</i>(1) accesses.

Djamal Belazzougui Paolo Boldi Rasmus Pagh Sebastiano Vigna Monotone minimal perfect hashing: searching a sorted table with <i>O</i>(1) accesses. 785-794 2009 SODA http://doi.acm.org/10.1145/1496770.1496856 conf/soda/2009 db/conf/soda/soda2009.html#BelazzouguiBPV09