D. Belazzougui, P. Boldi, G. Ottaviano, R. Venturini, and S. Vigna, Cache-Oblivious Peeling of Random Hypergraphs, 2014 Data Compression Conference, pp.352-361, 2014.
DOI : 10.1109/DCC.2014.48
URL : http://arxiv.org/abs/1312.0526

D. Belazzougui, C. Fabiano, M. Botelho, and . Dietzfelbinger, Hash, Displace, and Compress, European Symposium on Algorithms, pp.682-693, 2009.
DOI : 10.1007/978-3-642-04128-0_61
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.568.130

C. Fabiano, R. Botelho, N. Pagh, and . Ziviani, Simple and space-efficient minimal perfect hash functions, Algorithms and Data Structures, pp.139-150, 2007.

C. Fabiano, R. Botelho, N. Pagh, and . Ziviani, Practical perfect hashing in nearly optimal space, Information Systems, vol.38, issue.1, pp.108-131, 2013.

C. Chang and C. Lin, Perfect Hashing Schemes for Mining Association Rules, The Computer Journal, vol.48, issue.2, pp.168-179, 2005.
DOI : 10.1093/comjnl/bxh074

A. Jarrod, I. Chapman, S. Ho, S. Sunkara, . Luo et al., Meraculous: de novo genome assembly with short paired-end reads, PloS one, vol.6, issue.8, p.23501, 2011.

B. Chen, . Schmidt, L. Douglas, and . Maskell, A hybrid short read mapping accelerator, BMC Bioinformatics, vol.14, issue.1, pp.6710-1186, 2013.
DOI : 10.1093/bioinformatics/btp352
URL : http://doi.org/10.1186/1471-2105-14-67

A. Chikhi, P. Limasset, and . Medvedev, Compacting de Bruijn graphs from sequencing data quickly and in low memory, Bioinformatics, vol.32, issue.12, pp.201-208, 2016.
DOI : 10.1093/bioinformatics/btw279
URL : https://hal.archives-ouvertes.fr/hal-01395704

J. Zbigniew, G. Czech, . Havas, S. Bohdan, and . Majewski, Perfect hashing, Theoretical Computer Science, vol.182, issue.1, pp.1-143, 1997.

L. Michael, J. Fredman, and . Komlós, On the size of separating systems and families of perfect hash functions, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.1, pp.61-68, 1984.

M. Genuzio, G. Ottaviano, and S. Vigna, Fast Scalable Construction of (Minimal Perfect Hash) Functions, Experimental Algorithms: 15th International Symposium Proceedings, pp.339-35210, 2016.
DOI : 10.1007/3-540-39757-4_20
URL : http://arxiv.org/abs/1603.04330

Y. Lu, B. Prabhakar, and F. Bonomi, Perfect Hashing for Network Applications, 2006 IEEE International Symposium on Information Theory, pp.2774-2778, 2006.
DOI : 10.1109/ISIT.2006.261567
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.816

G. Marsaglia, Xorshift RNGs, Journal of Statistical Software, vol.8, issue.14, pp.1-6, 2003.
DOI : 10.18637/jss.v008.i14
URL : http://doi.org/10.18637/jss.v008.i14

K. Mehlhorn, On the program size of perfect and universal hash functions, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.170-175, 1982.
DOI : 10.1109/SFCS.1982.80