Djamal Belazzougui

Chen Qian

Qin Zhang

Proceedings of the 25th IEEE International Conference on Network Protocols, 2017

Representing the Suffix Tree with the CDAWG.

[BibT_eX]

[DOI]

Fabio Cunial

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Flexible Indexing of Repetitive Collections.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Compressed Suffix Array.

[BibT_eX]

[DOI]

Veli Mäkinen

Daniel Valenzuela

Encyclopedia of Algorithms, 2016

Predecessor Search, String Algorithms and Data Structures.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Indexing and querying color sets of images.

[BibT_eX]

[DOI]

Roman Kolpakov

Theor. Comput. Sci., 2016

Optimal Las Vegas reduction from one-way set reconciliation to error correction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Practical combinations of repetition-aware data structures.

[BibT_eX]

[DOI]

CoRR, 2016

Compressed String Dictionary Search with Edit Distance One.

[BibT_eX]

[DOI]

Rossano Venturini

Algorithmica, 2016

Lempel-Ziv Decoding in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Fully Dynamic de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Range Predecessor and Lempel-Ziv Parsing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Edit Distance: Sketching, Streaming, and Document Exchange.

[BibT_eX]

[DOI]

Qin Zhang

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Optimal Lower and Upper Bounds for Representing Sequences.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Efficient Deterministic Single Round Document Exchange for Edit Distance.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Algorithmica, 2015

Space-Efficient Detection of Unusual Words.

[BibT_eX]

[DOI]

Fabio Cunial

Proceedings of the String Processing and Information Retrieval, 2015

Access, Rank, and Select in Grammar-compressed Strings.

[BibT_eX]

[DOI]

Patrick Hagge Cording

Yasuo Tabei

Proceedings of the Algorithms - ESA 2015, 2015

Queries on LZ-Bounded Encodings.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

Yasuo Tabei

Proceedings of the 2015 Data Compression Conference, 2015

Composite Repetition-Aware Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9781107078536, 2015

2014

Alphabet-Independent Compressed Text Indexing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Simple, compact and robust approximate string dictionary.

[BibT_eX]

[DOI]

Ibrahim Chegrane

J. Discrete Algorithms, 2014

Rank, select and access in grammar-compressed strings.

[BibT_eX]

[DOI]

Yasuo Tabei

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Jesper Sindahl Nielsen

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Linear time construction of compressed text indices in compact space.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Relative FM-Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2014

Indexed Matching Statistics and Shortest Unique Substrings.

[BibT_eX]

[DOI]

Fabio Cunial

Proceedings of the String Processing and Information Retrieval, 2014

Cache-Oblivious Peeling of Random Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

2013

Approximate regular expression matching with multi-strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Improved compressed indexes for full-text document retrieval.

[BibT_eX]

[DOI]

Daniel Valenzuela

J. Discrete Algorithms, 2013

Various improvements to text fingerprinting.

[BibT_eX]

[DOI]

Roman Kolpakov

J. Discrete Algorithms, 2013

Better Space Bounds for Parameterized Range Majority and Minority.

[BibT_eX]

[DOI]

Travis Gagie

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Compressed static functions with applications.

[BibT_eX]

[DOI]

Rossano Venturini

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Single and Multiple Consecutive Permutation Motif Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Average Optimal String Matching in Packed Strings.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Predecessor search with distance-sensitive query time

[BibT_eX]

[DOI]

Paolo Boldi

Sebastiano Vigna

CoRR, 2012

New Lower and Upper Bounds for Representing Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Compressed String Dictionary Look-Up with Edit Distance One.

[BibT_eX]

[DOI]

Rossano Venturini

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Theory and practice of monotone minimal perfect hashing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Improved Compressed Indexes for Full-Text Document Retrieval.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Dynamic Z-Fast Tries.

[BibT_eX]

[DOI]

Paolo Boldi

Sebastiano Vigna

Proceedings of the String Processing and Information Retrieval, 2010

Worst Case Efficient Single and Multiple String Matching in the RAM Model.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Fast Prefix Search in Little Space, with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Succinct Dictionary Matching with No Slowdown.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Monotone minimal perfect hashing: searching a sorted table with <i>O</i>(1) accesses.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hash, Displace, and Compress.

[BibT_eX]

[DOI]

Fabiano C. Botelho

Martin Dietzfelbinger

Proceedings of the Algorithms, 2009

Faster and Space-Optimal Edit Distance "1" Dictionary.

[BibT_eX]

[DOI]