272 citations · 458 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 2 cited
Fast Scalable Construction of (Minimal Perfect Hash) Functions
Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna
Recent 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…
cs.DS2016★ 112 cited
Compressing Graphs and Indexes with Recursive Graph Bisection
Laxman Dhulipala, Igor Kabiljo, Brian Karrer +3
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be…