Johannes Fischer

Stefan Kratsch

Srinivasa Rao Satti

Dagstuhl Reports, 2018

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.

[BibT_eX]

[DOI]

Algorithmica, 2018

Lempel-Ziv-78 Compressed String Dictionaries.

[BibT_eX]

[DOI]

Julian Arz

Algorithmica, 2018

Simple, Fast and Lightweight Parallel Wavelet Tree Construction.

[BibT_eX]

[DOI]

Marvin Löbel

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Fast and Simple Parallel Wavelet Tree and Matrix Construction.

[BibT_eX]

[DOI]

CoRR, 2017

Compression with the tudocomp Framework.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Dismantling DivSufSort.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Modularisierung im Informatikunttericht aus lernpsychologischer Perspektive.

[BibT_eX]

[DOI]

Arno Pasternak

Proceedings of the Informatische Bildung zum Verstehen und Gestalten der digitalen Welt, 2017

FLOUDS: A Succinct File System Structure.

[BibT_eX]

[DOI]

Proceedings of the Position Papers of the 2017 Federated Conference on Computer Science and Information Systems, 2017

Lempel-Ziv Compression in a Sliding Window.

[BibT_eX]

[DOI]

Philip Bille

Patrick Hagge Cording

Inge Li Gørtz

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

Engineering a Distributed Full-Text Index.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Compressed Range Minimum Queries.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Sparse Text Indexing in Small Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Inducing Suffix and LCP Arrays in External Memory.

[BibT_eX]

[DOI]

Timo Bingmann

Vitaly Osipov

ACM J. Exp. Algorithmics, 2016

GLOUDS: Representing tree-like graphs.

[BibT_eX]

[DOI]

Daniel Peters

J. Discrete Algorithms, 2016

Deterministic Sparse Suffix Sorting on Rewritable Texts.

[BibT_eX]

[DOI]

Tomohiro I

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

A Practical Succinct Data Structure for Tree-Like Graphs.

[BibT_eX]

[DOI]

Daniel Peters

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Beyond the Runs Theorem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Approximating LZ77 via Small-Space Multiple-Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Lempel Ziv Computation in Small Space (LZ-CISS).

[BibT_eX]

[DOI]

Tomohiro I

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

Alphabet-Dependent String Searching with Wexponential Search Trees.

[BibT_eX]

[DOI]

Pawel Gawrychowski

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

2014

High-Order Entropy Compressed Bit Vectors with Rank/Select.

[BibT_eX]

[DOI]

Kai Beskers

Algorithms, 2014

LZ-Compressed String Dictionaries.

[BibT_eX]

[DOI]

Julian Arz

Proceedings of the Data Compression Conference, 2014

2013

On (Dynamic) Range Minimum Queries in External Memory.

[BibT_eX]

[DOI]

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

Sparse Suffix Tree Construction in Small Space.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations.

[BibT_eX]

[DOI]

Jérémy Barbay

Gonzalo Navarro

Theor. Comput. Sci., 2012

Forbidden Patterns.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Combined data structure for previous- and next-smaller-values.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Inducing the LCP-Array.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Compact Representation of Posets.

[BibT_eX]

[DOI]

Arash Farzan

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Finding Range Minima in the Middle: Approximations and Applications.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

New common ancestor problems in trees and directed acyclic graphs.

[BibT_eX]

[DOI]

Daniel H. Huson

Inf. Process. Lett., 2010

Wee LCP.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations

[BibT_eX]

[DOI]

Jérémy Barbay

CoRR, 2010

CST++.

[BibT_eX]

[DOI]

Enno Ohlebusch

Simon Gog

Proceedings of the String Processing and Information Retrieval, 2010

Optimal Succinctness for Range Minimum Queries.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Advantages of Shared Data Structures for Sequences of Balanced Parentheses.

[BibT_eX]

[DOI]

Simon Gog

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

Faster entropy-bounded compressed suffix trees.

[BibT_eX]

[DOI]

Veli Mäkinen

Gonzalo Navarro

Theor. Comput. Sci., 2009

Short Labels for Lowest Common Ancestors in Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing.

[BibT_eX]

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Space Efficient String Mining under Frequency Constraints.

[BibT_eX]

[DOI]

Veli Mäkinen

Niko Välimäki

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.

[BibT_eX]

[DOI]

Horst Martin Stühler

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

An(other) Entropy-Bounded Compressed Suffix Tree.

[BibT_eX]

[DOI]

Veli Mäkinen

Gonzalo Navarro

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

Suffix Arrays on Words.

[BibT_eX]

[DOI]

Paolo Ferragina

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Two-Dimensional Range Minimum Queries.

[BibT_eX]

[DOI]

Amihood Amir

Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

SimShift: Identifying structural similarities from NMR chemical shifts.

[BibT_eX]

[DOI]

Simon W. Ginzinger

Bioinform., 2006

Optimal String Mining Under Frequency Constraints.

[BibT_eX]

[DOI]

Stefan Kramer

Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Fast Frequent String Mining Using Suffix Arrays.

[BibT_eX]

[DOI]

Stefan Kramer

Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

A 2-Approximation Algorithm for Sorting by Prefix Reversals.

[BibT_eX]

[DOI]

Simon W. Ginzinger

Proceedings of the Algorithms, 2005

2003

Towards Optimizing Conjunctive Inductive Queries.

[BibT_eX]