( en | de | ru )

 

Disambiguation of "Belazzougui, Djamal"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Prefix Search in Little Space, with Applications.

, , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 427-438. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Djamal Tehranian

Mitra Djamal

Djamal Benhacine

Djamal Benzerouk

Djamal Afrukhteh

 

Other publications of authors with the same name

Predecessor search with distance-sensitive query time, , and . CoRR, (2012)Cache-Oblivious Peeling of Random Hypergraphs., , , , and . DCC, page 352-361. IEEE, (2014)Block trees., , , , , , , , and . J. Comput. Syst. Sci., (2021)Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to k-Mer Annotation., , and . J. Comput. Biol., 29 (2): 140-154 (2022)Average Optimal String Matching in Packed Strings., and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 37-48. Springer, (2013)A concise forwarding information base for scalable and fast name lookups., , , and . ICNP, page 1-10. IEEE Computer Society, (2017)Improved space-time tradeoffs for approximate full-text indexing with one edit error. CoRR, (2011)Worst Case Efficient Single and Multiple String Matching in the RAM Model.. IWOCA, volume 6460 of Lecture Notes in Computer Science, page 90-102. Springer, (2010)Improved compressed indexes for full-text document retrieval., , and . J. Discrete Algorithms, (2013)Weighted Ancestors in Suffix Trees Revisited., , , and . CPM, volume 191 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)