| Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009 | 107 | 2009 |
| Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses D Belazzougui, P Boldi, R Pagh, S Vigna Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 99 | 2009 |
| Alphabet-independent compressed text indexing D Belazzougui, G Navarro ACM Transactions on Algorithms (TALG) 10 (4), 23, 2014 | 88 | 2014 |
| Genome-scale algorithm design V Mäkinen, D Belazzougui, F Cunial, AI Tomescu Cambridge University Press, 2015 | 78 | 2015 |
| Linear time construction of compressed text indices in compact space D Belazzougui Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 53 | 2014 |
| Improved compressed indexes for full-text document retrieval D Belazzougui, G Navarro, D Valenzuela Journal of Discrete Algorithms 18, 3-13, 2013 | 51 | 2013 |
| Composite repetition-aware data structures D Belazzougui, F Cunial, T Gagie, N Prezza, M Raffinot Annual Symposium on Combinatorial Pattern Matching, 26-39, 2015 | 50 | 2015 |
| Versatile succinct representations of the bidirectional burrows-wheeler transform D Belazzougui, F Cunial, J Kärkkäinen, V Mäkinen European Symposium on Algorithms, 133-144, 2013 | 48 | 2013 |
| Theory and practice of monotone minimal perfect hashing D Belazzougui, P Boldi, R Pagh, S Vigna Journal of Experimental Algorithmics (JEA) 16, 3.2, 2011 | 46 | 2011 |
| Succinct dictionary matching with no slowdown D Belazzougui Annual Symposium on Combinatorial Pattern Matching, 88-100, 2010 | 46 | 2010 |
| New lower and upper bounds for representing sequences D Belazzougui, G Navarro European Symposium on Algorithms, 181-192, 2012 | 43 | 2012 |
| Fast prefix search in little space, with applications D Belazzougui, P Boldi, R Pagh, S Vigna European Symposium on Algorithms, 427-438, 2010 | 37 | 2010 |
| Queries on LZ-bounded encodings D Belazzougui, T Gagie, P Gawrychowski, J Kärkkäinen, A Ordónez, ... 2015 Data Compression Conference, 83-92, 2015 | 35 | 2015 |
| Range predecessor and Lempel-Ziv parsing D Belazzougui, SJ Puglisi Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 32 | 2016 |
| Optimal lower and upper bounds for representing sequences D Belazzougui, G Navarro ACM Transactions on Algorithms (TALG) 11 (4), 31, 2015 | 32 | 2015 |
| Edit distance: Sketching, streaming, and document exchange D Belazzougui, Q Zhang 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 51-60, 2016 | 27 | 2016 |
| Access, rank, and select in grammar-compressed strings D Belazzougui, PH Cording, SJ Puglisi, Y Tabei Algorithms-ESA 2015, 142-154, 2015 | 22 | 2015 |
| Faster and space-optimal edit distance “1” dictionary D Belazzougui Annual Symposium on Combinatorial Pattern Matching, 154-167, 2009 | 22 | 2009 |
| Single and multiple consecutive permutation motif search D Belazzougui, A Pierrot, M Raffinot, S Vialette International Symposium on Algorithms and Computation, 66-77, 2013 | 21 | 2013 |
| Fully dynamic de Bruijn graphs D Belazzougui, T Gagie, V Mäkinen, M Previtali International Symposium on String Processing and Information Retrieval, 145-152, 2016 | 19 | 2016 |
Fabio CunialMax Planck Institute of Molecular Cell Biology and GeneticsVerified email at mpi-cbg.de
