2 citations · 3 across the 2 of their papers we have counts for
2 papers
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.DM2014★ 1 cited
Eulerian digraphs and Dyck words, a bijection
Pietro Codara, Ottavio M. D'Antona, Marco Genuzio
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in bot…