Travis Gagie

CoRR, 2024

Movelet Trees.

[BibT_eX]

[DOI]

CoRR, 2024

MIOV: Reordering MOVI for even better locality.

[BibT_eX]

[DOI]

CoRR, 2024

Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests.

[BibT_eX]

[DOI]

Dominika Draesslerová

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

b-move: Faster Bidirectional Character Extensions in a Run-Length Compressed Index.

[BibT_eX]

[DOI]

Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

Space-Efficient Conversions from SLPs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Wheeler Maps.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

How to Find Long Maximal Exact Matches and Ignore Short Ones.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 28th International Conference, 2024

Another virtue of wavelet forests.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2024

Faster Maximal Exact Matches with Lazy LCP Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2024

Solving the Minimal Positional Substring Cover Problem in Sublinear Space.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data.

[BibT_eX]

[DOI]

Bioinform., September, 2023

Faster compressed quadtrees.

[BibT_eX]

[DOI]

Guillermo de Bernardo

J. Comput. Syst. Sci., 2023

Ruler Wrapping.

[BibT_eX]

[DOI]

Mozhgan Saeidi

Allan Sapucaia

Int. J. Comput. Geom. Appl., 2023

Suffixient Sets.

[BibT_eX]

[DOI]

CoRR, 2023

Acceleration of FM-Index Queries Through Prefix-Free Parsing.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Dynamic Compact Planar Embeddings.

[BibT_eX]

[DOI]

Michael St Denis

Proceedings of the String Processing and Information Retrieval, 2023

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Data Structures for SMEM-Finding in the PBWT.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Flexible Grammar-based Indexes (invited paper).

[BibT_eX]

[DOI]

Proceedings of the 23rd Conference Information Technologies, 2023

Recursive Prefix-Free Parsing for Building Big BWTs.

[BibT_eX]

[DOI]

Marco Oliva

Ardavan Shahrabi Farahani

Christina Boucher

Proceedings of the Data Compression Conference, 2023

Augmented Thresholds for MONI.

[BibT_eX]

[DOI]

César Martínez-Guardiola

Proceedings of the Data Compression Conference, 2023

Computing matching statistics on Wheeler DFAs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2023

MONI Can Find k-MEMs.

[BibT_eX]

[DOI]

Igor Tatarnikov

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Sum-of-Local-Effects Data Structures for Separable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Efficient and compact representations of some non-canonical prefix-free codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Correction to: Graph Compression for Adjacency-Matrix Multiplication.

[BibT_eX]

[DOI]

SN Comput. Sci., 2022

Graph Compression for Adjacency-Matrix Multiplication.

[BibT_eX]

[DOI]

SN Comput. Sci., 2022

Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

MONI: A Pangenomic Index for Finding Maximal Exact Matches.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Finding Maximal Exact Matches Using the r-Index.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Preface to Special Issue for DCC 2020.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Space-efficient conversions from SLPs.

[BibT_eX]

[DOI]

Artur Jez

CoRR, 2022

A fast and simple O(z log n)-space index for finding approximately longest common substrings.

[BibT_eX]

[DOI]

Nick Fagan

Jorge Hermo González

CoRR, 2022

Space-efficient RLZ-to-LZ77 conversion.

[BibT_eX]

[DOI]

CoRR, 2022

Rectangular Ruler Wrapping.

[BibT_eX]

[DOI]

Xing Lyu

CoRR, 2022

MARIA: Multiple-alignment r-index with aggregation.

[BibT_eX]

[DOI]

CoRR, 2022

Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Marinella Sciortino

CoRR, 2022

KATKA: A KRAKEN-like tool with k given at query time.

[BibT_eX]

[DOI]

CoRR, 2022

An n H<sub>k</sub>-compressed searchable partial-sums data structure for static sequences of sublogarithmic positive integers.

[BibT_eX]

[DOI]

CoRR, 2022

MONI can find k-MEMs.

[BibT_eX]

[DOI]

CoRR, 2022

KATKA: A KRAKEN-Like Tool with k Given at Query Time.

[BibT_eX]

[DOI]

Ben Langmead

Proceedings of the String Processing and Information Retrieval, 2022

On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

CSTs for Terabyte-Sized Data.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

Simple Worst-Case Optimal Adaptive Prefix-Free Coding.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

RLBWT Tricks.

[BibT_eX]

[DOI]

Nathaniel K. Brown

Massimiliano Rossi

Proceedings of the Data Compression Conference, 2022

2021

Maximal unbordered factors of random strings.

[BibT_eX]

[DOI]

Patrick Hagge Cording

Mathias Bæk Tejs Knudsen

Tomasz Kociumaka

Theor. Comput. Sci., 2021

Block trees.

[BibT_eX]

[DOI]

Yasuo Tabei

J. Comput. Syst. Sci., 2021

An index for moving objects with constant-time access to their compressed trajectories.

[BibT_eX]

[DOI]

Int. J. Geogr. Inf. Sci., 2021

Compact Euler Tours of Trees with Small Maximum Degree.

[BibT_eX]

[DOI]

CoRR, 2021

$r$-indexing Wheeler graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Range Majorities and Minorities in Arrays.

[BibT_eX]

[DOI]

Algorithmica, 2021

Compressing and Indexing Aligned Readsets.

[BibT_eX]

[DOI]

Garance Gourdel

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

Efficiently Merging r-indexes.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

PHONI: Streamed Matching Statistics with Multi-Genome References.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

A Fast and Small Subsampled R-Index.

[BibT_eX]

[DOI]

Dustin Cobas

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Succinct Euler-Tour Trees.

[BibT_eX]

Sebastian Wild

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

PFP Compressed Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

Tree path majority data structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Refining the <i>r</i>-index.

[BibT_eX]

[DOI]

Hideo Bannai

Tomohiro I

Theor. Comput. Sci., 2020

Matching Reads to Many Genomes with the r-Index.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space.

[BibT_eX]

[DOI]

J. ACM, 2020

Computation over compressed data.

[BibT_eX]

[DOI]

Inf. Comput., 2020

PFP Data Structures.

[BibT_eX]

[DOI]

CoRR, 2020

Fast and compact planar embeddings.

[BibT_eX]

[DOI]

Leo Ferres

José Fuentes-Sepúlveda

Comput. Geom., 2020

More Time-Space Tradeoffs for Finding a Shortest Unique Substring.

[BibT_eX]

[DOI]

Algorithms, 2020

Compressed Dynamic Range Majority and Minority Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 2020

Practical Random Access to SLP-Compressed Texts.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Yoshimasa Takabatake

Proceedings of the String Processing and Information Retrieval, 2020

Decompressing Lempel-Ziv Compressed Text.

[BibT_eX]

[DOI]

Philip Bille

Mikko Berggren Ettienne

Inge Li Gørtz

Proceedings of the Data Compression Conference, 2020

2019

Compressed Indexes for Repetitive Textual Datasets.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Path queries on functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Sparse Dynamic Programming on DAGs with Small Width.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

A compact index for order-preserving pattern matching.

[BibT_eX]

[DOI]

Gianni Decaroli

Softw. Pract. Exp., 2019

25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Tree-Shape Grammars for Random Access.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Yoshimasa Takabatake

CoRR, 2019

Simulating the DNA String Graph in Succinct Space.

[BibT_eX]

[DOI]

Diego Díaz-Domínguez

CoRR, 2019

Prefix-free parsing for building big BWTs.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2019

Rpair: Rescaling RePair with Rsync.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Faster Dynamic Compressed d-ary Relations.

[BibT_eX]

[DOI]

Diego Arroyuelo

Guillermo de Bernardo

Proceedings of the String Processing and Information Retrieval, 2019

Tunneling on Wheeler Graphs.

[BibT_eX]

[DOI]

Jarno N. Alanko

Louisa Seelbach Benkner

Proceedings of the Data Compression Conference, 2019

Simulating the DNA Overlap Graph in Succinct Space.

[BibT_eX]

[DOI]

Diego Díaz-Domínguez

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

A separation between RLSLPs and LZ77.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Bidirectional Variable-Order de Bruijn Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Diverse Palindromic Factorization is NP-Complete.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Relative compression of trajectories.

[BibT_eX]

[DOI]

CoRR, 2018

The Read-Optimized Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

CoRR, 2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Prefix-Free Parsing for Building Big BWTs.

[BibT_eX]

[DOI]

CoRR, 2018

Fast Lempel-Ziv Decompression in Linear Space.

[BibT_eX]

[DOI]

Philip Bille

Mikko Berggren Ettienne

Inge Li Gørtz

CoRR, 2018

Relative Suffix Trees.

[BibT_eX]

[DOI]

Comput. J., 2018

Practical dynamic de Bruijn graphs.

[BibT_eX]

[DOI]

Bioinform., 2018

Guest Editorial: Special Issue on Compact Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 2018

Prefix-Free Parsing for Building Big BWTs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Optimal-Time Text Indexing in BWT-runs Bounded Space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2018

On the Approximation Ratio of Lempel-Ziv Parsing.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree Path Majority Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication.

[BibT_eX]

[DOI]

Susana Ladra

Proceedings of the 2018 Data Compression Conference, 2018

Online LZ77 Parsing and Matching Statistics with RLBWTs.

[BibT_eX]

[DOI]

Hideo Bannai

Tomohiro I

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Wheeler graphs: A framework for BWT-based data structures.

[BibT_eX]

[DOI]

Jouni Sirén

Theor. Comput. Sci., 2017

String cadences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Compressed Spaced Suffix Arrays.

[BibT_eX]

[DOI]

Daniel Valenzuela

Math. Comput. Sci., 2017

Block Graphs in Practice.

[BibT_eX]

[DOI]

Christopher Hoobin

Math. Comput. Sci., 2017

Burrows-Wheeler transform and LCP array construction in constant space.

[BibT_eX]

[DOI]

Felipe A. Louza

Guilherme P. Telles

J. Discrete Algorithms, 2017

Preface - Compact Data Structures.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Document retrieval on repetitive string collections.

[BibT_eX]

[DOI]

Inf. Retr. J., 2017

A Separation Between Run-Length SLPs and LZ77.

[BibT_eX]

[DOI]

CoRR, 2017

Exploiting Computation-Friendly Graph Compression Methods.

[BibT_eX]

[DOI]

Susana Ladra

CoRR, 2017

Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover.

[BibT_eX]

[DOI]

CoRR, 2017

Fast Locating with the RLBWT.

[BibT_eX]

[DOI]

CoRR, 2017

Parallel Construction of Compact Planar Embeddings.

[BibT_eX]

[DOI]

Leo Ferres

José Fuentes-Sepúlveda

Luis Antonio Brasil Kowada

CoRR, 2017

Fast and Simple Jumbled Indexing for Binary RLE Strings.

[BibT_eX]

[DOI]

Jens Stoye

CoRR, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.

[BibT_eX]

[DOI]

CoRR, 2017

Succinct colored de Bruijn graphs.

[BibT_eX]

[DOI]

Bioinform., 2017

Efficient Compression and Indexing of Trajectories.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

An Encoding for Order-Preserving Matching.

[BibT_eX]

[DOI]

Rossano Venturini

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Compressed Dynamic Range Majority Data Structures.

[BibT_eX]

[DOI]

Luis Antonio Brasil Kowada

Proceedings of the 2017 Data Compression Conference, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Jens Stoye

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

Dictionary-Based Data Compression.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Rank and Select Operations on Sequences.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Toward a Succinct Index for Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

CoRR, 2016

Practical combinations of repetition-aware data structures.

[BibT_eX]

[DOI]

CoRR, 2016

Analyzing Relative Lempel-Ziv Reference Construction.

[BibT_eX]

[DOI]

Daniel Valenzuela

Proceedings of the String Processing and Information Retrieval, 2016

Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

RLZAP: Relative Lempel-Ziv with Adaptive Pointers.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Fully Dynamic de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Longest Common Abelian Factors and Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

2015

Efficient and Compact Representations of Prefix Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Approximate pattern matching in LZ77-compressed texts.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Relative Compressed Suffix Trees.

[BibT_eX]

[DOI]

CoRR, 2015

Diverse Palindromic Factorization is NP-Complete.

[BibT_eX]

[DOI]

CoRR, 2015

Approximating LZ77 in Small Space.

[BibT_eX]

[DOI]

CoRR, 2015

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.

[BibT_eX]

[DOI]

Algorithmica, 2015

Relative Select.

[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

Diverse Palindromic Factorization Is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Document Counting in Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

Faster Compressed Quadtrees.

[BibT_eX]

[DOI]

Javier I. González-Nova

Susana Ladra

Diego Seco

Proceedings of the 2015 Data Compression Conference, 2015

Variable-Order de Bruijn Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

Queries on LZ-Bounded Encodings.

[BibT_eX]

[DOI]

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

2014

A subquadratic algorithm for minimum palindromic factorization.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Searching and Indexing Genomic Databases via Kernelization.

[BibT_eX]

[DOI]

CoRR, 2014

Reusing an FM-index.

[BibT_eX]

[DOI]

Jouni Sirén

CoRR, 2014

Document Counting in Practice.

[BibT_eX]

[DOI]

CoRR, 2014

Suffix Arrays for Spaced-SNP Databases.

[BibT_eX]

[DOI]

CoRR, 2014

Entropy-bounded representation of point grids.

[BibT_eX]

[DOI]

Arash Farzan

Comput. Geom., 2014

Efficient Fully-Compressed Sequence Representations.

[BibT_eX]

[DOI]

Algorithmica, 2014

Relative Lempel-Ziv with Constant-Time Random Access.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2014

Relative FM-Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2014

LZ77-Based Self-indexing with Faster Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Relative Lempel-Ziv with Constant-Time Random Access.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

Indexed Geometric Jumbled Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Colored range queries and document retrieval.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Minimax trees in linear time with applications.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

AliBI: An Alignment-Based Index for Genomic Datasets.

[BibT_eX]

[DOI]

CoRR, 2013

Hybrid Indexes for Repetitive Datasets.

[BibT_eX]

[DOI]

CoRR, 2013

Better Space Bounds for Parameterized Range Majority and Minority.

[BibT_eX]

[DOI]

Djamal Belazzougui

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

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Document Listing on Repetitive Collections.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

New Algorithms for Position Heaps.

[BibT_eX]

[DOI]

Wing-Kai Hon

Tsung-Han Ku

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Heaviest Induced Ancestors and Longest Common Substrings.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

New algorithms on wavelet trees and applications to information retrieval.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Bounds from a card trick.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

An efficient algorithm to test square-freeness of strings compressed by straight-line programs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching

[BibT_eX]

[DOI]

CoRR, 2012

Sequential-Access FM-Indexes

[BibT_eX]

[DOI]

CoRR, 2012

Linear-Space Substring Range Counting over Polylogarithmic Alphabets

[BibT_eX]

[DOI]

CoRR, 2012

A Note on Sequence Prediction over Large Alphabets.

[BibT_eX]

[DOI]

Algorithms, 2012

Lightweight Data Indexing and Compression in External Memory.

[BibT_eX]

[DOI]

Paolo Ferragina

Algorithmica, 2012

Indexed Multi-pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Forbidden Patterns.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Faster Grammar-Based Self-index.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

2011

Tight bounds for online stable sorting.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

A Compressed Self-Index for Genomic Databases

[BibT_eX]

[DOI]

CoRR, 2011

A Faster LZ77-Based Index

[BibT_eX]

[DOI]

CoRR, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

Faster Approximate Pattern Matching in Compressed Repetitive Texts.

[BibT_eX]

[DOI]

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

Counting Colours in Compressed Strings.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Move-to-Front, Distance Coding, and Inversion Frequencies revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Pattern Kits

[BibT_eX]

[DOI]

CoRR, 2010

Colored Range Queries and Document Retrieval.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Fast and Compact Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Grammar-Based Compression in a Streaming Model.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Better Bouncer's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

New algorithms and lower bounds for sequential access data compression.

[BibT_eX]

[DOI]

PhD thesis, 2009

Compressed depth sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A New Algorithm for Building Alphabetic Minimax Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source

[BibT_eX]

[DOI]

CoRR, 2009

Grammar-Based Compression in a Streaming Model

[BibT_eX]

[DOI]

CoRR, 2009

Alphabet Partitioning for Compressed Rank/Select with Applications

[BibT_eX]

[DOI]

CoRR, 2009

Another Virtue of Wavelet Trees

[BibT_eX]

[DOI]

CoRR, 2009

New Algorithms and Lower Bounds for Sequential-Access Data Compression

[BibT_eX]

[DOI]

CoRR, 2009

Worst-Case Optimal Adaptive Prefix Coding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Range Quantile Queries: Another Virtue of Wavelet Trees.

[BibT_eX]

[DOI]

Andrew Turpin

Proceedings of the String Processing and Information Retrieval, 2009

Low-Memory Adaptive Prefix Coding.

[BibT_eX]

[DOI]

Marek Karpinski

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

On the Value of Multiple Read/Write Streams for Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Dictionary-Based Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Sorting streamed multisets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Dynamic asymmetric communication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Minimax Trees in Linear Time

[BibT_eX]

[DOI]

CoRR, 2008

2007

Dynamic Shannon coding.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Bounds for Compression in Streaming Models

[BibT_eX]

[DOI]

CoRR, 2007

Empirical entropy in context

[BibT_eX]

[DOI]

CoRR, 2007

A nearly tight memory-redundancy trade-off for one-pass compression

[BibT_eX]

[DOI]

CoRR, 2007

Space-Conscious Compression.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Large alphabets and incompressibility.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Compressing probability distributions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On the space complexity of one-pass compression

[BibT_eX]

[DOI]

CoRR, 2006

2005

Restructuring binary search trees revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Sorting a Low-Entropy Sequence

[BibT_eX]

[DOI]

CoRR, 2005

2003

New Ways to Construct Binary Search Trees.

[BibT_eX]

[DOI]