djamal belazzougui
djamal belazzougui
CERIST
Verified email at cerist.dz
Title
Cited by
Cited by
Year
Hash, displace, and compress
D Belazzougui, FC Botelho, M Dietzfelbinger
European Symposium on Algorithms, 682-693, 2009
1252009
Genome-scale algorithm design
V Mäkinen, D Belazzougui, F Cunial, AI Tomescu
Cambridge University Press, 2015
1172015
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
1122009
Alphabet-independent compressed text indexing
D Belazzougui, G Navarro
ACM Transactions on Algorithms (TALG) 10 (4), 1-19, 2014
982014
Composite repetition-aware data structures
D Belazzougui, F Cunial, T Gagie, N Prezza, M Raffinot
Annual Symposium on Combinatorial Pattern Matching, 26-39, 2015
632015
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
602013
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
582014
Improved compressed indexes for full-text document retrieval
D Belazzougui, G Navarro, D Valenzuela
Journal of Discrete Algorithms 18, 3-13, 2013
532013
Theory and practice of monotone minimal perfect hashing
D Belazzougui, P Boldi, R Pagh, S Vigna
Journal of Experimental Algorithmics (JEA) 16, 3.1-3.26, 2008
532008
Succinct dictionary matching with no slowdown
D Belazzougui
Annual Symposium on Combinatorial Pattern Matching, 88-100, 2010
492010
Fast prefix search in little space, with applications
D Belazzougui, P Boldi, R Pagh, S Vigna
European Symposium on Algorithms, 427-438, 2010
47*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
462015
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
452016
New lower and upper bounds for representing sequences
D Belazzougui, G Navarro
European Symposium on Algorithms, 181-192, 2012
432012
Optimal lower and upper bounds for representing sequences
D Belazzougui, G Navarro
ACM Transactions on Algorithms (TALG) 11 (4), 1-21, 2015
412015
Range predecessor and Lempel-Ziv parsing
D Belazzougui, SJ Puglisi
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
402016
Access, rank, and select in grammar-compressed strings
D Belazzougui, PH Cording, SJ Puglisi, Y Tabei
Algorithms-ESA 2015, 142-154, 2015
332015
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
292016
Representing the suffix tree with the CDAWG
D Belazzougui, F Cunial
arXiv preprint arXiv:1705.08640, 2017
252017
Bidirectional variable-order de Bruijn graphs
D Belazzougui, T Gagie, V Mäkinen, M Previtali, SJ Puglisi
LATIN 2016: Theoretical Informatics, 164-178, 2016
252016
The system can't perform the operation now. Try again later.
Articles 1–20