Djamal Belazzougui

According to our database1, Djamal Belazzougui authored at least 69 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Fully-functional bidirectional Burrows-Wheeler indexes.
CoRR, 2019

A framework for space-efficient variable-order Markov models.
Bioinformatics, 2019

Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Computing the Antiperiod(s) of a String.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing.
IEEE/ACM Trans. Netw., 2018

Bidirectional Variable-Order de Bruijn Graphs.
Int. J. Found. Comput. Sci., 2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs.
CoRR, 2018

Fast matching statistics in small space.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Random input helps searching predecessors.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017
A framework for space-efficient read clustering in metagenomic samples.
BMC Bioinformatics, 2017

A Framework for Space-Efficient String Kernels.
Algorithmica, 2017

Fast Label Extraction in the CDAWG.
Proceedings of the String Processing and Information Retrieval, 2017

A Fast, Small, and Dynamic Forwarding Information Base.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

A concise forwarding information base for scalable and fast name lookups.
Proceedings of the 25th IEEE International Conference on Network Protocols, 2017

Representing the Suffix Tree with the CDAWG.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Flexible Indexing of Repetitive Collections.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Compressed Suffix Array.
Encyclopedia of Algorithms, 2016

Predecessor Search, String Algorithms and Data Structures.
Encyclopedia of Algorithms, 2016

Indexing and querying color sets of images.
Theor. Comput. Sci., 2016

Optimal Las Vegas reduction from one-way set reconciliation to error correction.
Theor. Comput. Sci., 2016

A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching.
CoRR, 2016

Range Majorities and Minorities in Arrays.
CoRR, 2016

Linear-time string indexing and analysis in small space.
CoRR, 2016

Practical combinations of repetition-aware data structures.
CoRR, 2016

Compressed String Dictionary Search with Edit Distance One.
Algorithmica, 2016

Lempel-Ziv Decoding in External Memory.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Fully Dynamic de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2016

Range Predecessor and Lempel-Ziv Parsing.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Edit Distance: Sketching, Streaming, and Document Exchange.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Optimal Lower and Upper Bounds for Representing Sequences.
ACM Trans. Algorithms, 2015

Efficient Deterministic Single Round Document Exchange for Edit Distance.
CoRR, 2015

Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error.
Algorithmica, 2015

Space-Efficient Detection of Unusual Words.
Proceedings of the String Processing and Information Retrieval, 2015

Access, Rank, and Select in Grammar-compressed Strings.
Proceedings of the Algorithms - ESA 2015, 2015

Queries on LZ-Bounded Encodings.
Proceedings of the 2015 Data Compression Conference, 2015

Composite Repetition-Aware Data Structures.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing.
Cambridge University Press, ISBN: 9781107078536, 2015

2014
Alphabet-Independent Compressed Text Indexing.
ACM Trans. Algorithms, 2014

Simple, compact and robust approximate string dictionary.
J. Discrete Algorithms, 2014

Rank, select and access in grammar-compressed strings.
CoRR, 2014

Faster construction of asymptotically good unit-cost error correcting codes in the RAM model.
CoRR, 2014

Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Linear time construction of compressed text indices in compact space.
Proceedings of the Symposium on Theory of Computing, 2014

Relative FM-Indexes.
Proceedings of the String Processing and Information Retrieval, 2014

Indexed Matching Statistics and Shortest Unique Substrings.
Proceedings of the String Processing and Information Retrieval, 2014

Cache-Oblivious Peeling of Random Hypergraphs.
Proceedings of the Data Compression Conference, 2014

2013
Approximate regular expression matching with multi-strings.
J. Discrete Algorithms, 2013

Improved compressed indexes for full-text document retrieval.
J. Discrete Algorithms, 2013

Various improvements to text fingerprinting.
J. Discrete Algorithms, 2013

Better Space Bounds for Parameterized Range Majority and Minority.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Compressed static functions with applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Single and Multiple Consecutive Permutation Motif Search.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.
Proceedings of the Algorithms - ESA 2013, 2013

Average Optimal String Matching in Packed Strings.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model.
J. Discrete Algorithms, 2012

Predecessor search with distance-sensitive query time
CoRR, 2012

New Lower and Upper Bounds for Representing Sequences.
Proceedings of the Algorithms - ESA 2012, 2012

Compressed String Dictionary Look-Up with Edit Distance One.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Theory and practice of monotone minimal perfect hashing.
ACM Journal of Experimental Algorithmics, 2011

Improved Compressed Indexes for Full-Text Document Retrieval.
Proceedings of the String Processing and Information Retrieval, 2011

2010
Worst case efficient single and multiple string matching in the Word-RAM model
CoRR, 2010

Dynamic Z-Fast Tries.
Proceedings of the String Processing and Information Retrieval, 2010

Worst Case Efficient Single and Multiple String Matching in the RAM Model.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Fast Prefix Search in Little Space, with Applications.
Proceedings of the Algorithms, 2010

Succinct Dictionary Matching with No Slowdown.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hash, Displace, and Compress.
Proceedings of the Algorithms, 2009

Faster and Space-Optimal Edit Distance "1" Dictionary.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Theory and Practise of Monotone Minimal Perfect Hashing.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009


  Loading...