Följ
djamal belazzougui
djamal belazzougui
CERIST
Verifierad e-postadress på cerist.dz
Titel
Citeras av
Citeras av
År
Genome-scale algorithm design
V Mäkinen, D Belazzougui, F Cunial, AI Tomescu
Cambridge University Press, 2015
1562015
Hash, displace, and compress
D Belazzougui, FC Botelho, M Dietzfelbinger
European Symposium on Algorithms, 682-693, 2009
1402009
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
1182009
Alphabet-independent compressed text indexing
D Belazzougui, G Navarro
ACM Transactions on Algorithms (TALG) 10 (4), 1-19, 2014
1012014
Composite repetition-aware data structures
D Belazzougui, F Cunial, T Gagie, N Prezza, M Raffinot
Annual Symposium on Combinatorial Pattern Matching, 26-39, 2015
732015
Optimal lower and upper bounds for representing sequences
D Belazzougui, G Navarro
ACM Transactions on Algorithms (TALG) 11 (4), 1-21, 2015
642015
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
642008
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
632013
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
612014
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
572016
Improved compressed indexes for full-text document retrieval
D Belazzougui, G Navarro, D Valenzuela
Journal of Discrete Algorithms 18, 3-13, 2013
552013
Succinct dictionary matching with no slowdown
D Belazzougui
Annual Symposium on Combinatorial Pattern Matching, 88-100, 2010
542010
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
512015
Range predecessor and Lempel-Ziv parsing
D Belazzougui, SJ Puglisi
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
482016
Fast prefix search in little space, with applications
D Belazzougui, P Boldi, R Pagh, S Vigna
European Symposium on Algorithms, 427-438, 2010
482010
New lower and upper bounds for representing sequences
D Belazzougui, G Navarro
European Symposium on Algorithms, 181-192, 2012
402012
Linear-time string indexing and analysis in small space
D Belazzougui, F Cunial, J Kärkkäinen, V Mäkinen
ACM Transactions on Algorithms (TALG) 16 (2), 1-54, 2020
392020
Access, rank, and select in grammar-compressed strings
D Belazzougui, PH Cording, SJ Puglisi, Y Tabei
Algorithms-ESA 2015, 142-154, 2015
392015
Representing the suffix tree with the CDAWG
D Belazzougui, F Cunial
arXiv preprint arXiv:1705.08640, 2017
302017
Memory-efficient and ultra-fast network lookup and forwarding using Othello hashing
Y Yu, D Belazzougui, C Qian, Q Zhang
IEEE/ACM Transactions on Networking 26 (3), 1151-1164, 2018
292018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20