Travis Gagie

According to our database1, Travis Gagie authored at least 110 papers between 2003 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Compressed Indexes for Repetitive Textual Datasets.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Sparse Dynamic Programming on DAGs with Small Width.
ACM Trans. Algorithms, 2019

Prefix-free parsing for building big BWTs.
Algorithms for Molecular Biology, 2019

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.
Proceedings of the Research in Computational Molecular Biology, 2019

Tunneling on Wheeler Graphs.
Proceedings of the Data Compression Conference, 2019

Simulating the DNA Overlap Graph in Succinct Space.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
A separation between RLSLPs and LZ77.
J. Discrete Algorithms, 2018

Diverse Palindromic Factorization is NP-Complete.
Int. J. Found. Comput. Sci., 2018

Relative Suffix Trees.
Comput. J., 2018

Practical dynamic de Bruijn graphs.
Bioinformatics, 2018

Guest Editorial: Special Issue on Compact Data Structures.
Algorithmica, 2018

Prefix-Free Parsing for Building Big BWTs.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Optimal-Time Text Indexing in BWT-runs Bounded Space.
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.
Proceedings of the Research in Computational Molecular Biology, 2018

On the Approximation Ratio of Lempel-Ziv Parsing.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree Path Majority Data Structures.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication.
Proceedings of the 2018 Data Compression Conference, 2018

Two-Dimensional Block Trees.
Proceedings of the 2018 Data Compression Conference, 2018

Online LZ77 Parsing and Matching Statistics with RLBWTs.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Wheeler graphs: A framework for BWT-based data structures.
Theor. Comput. Sci., 2017

String cadences.
Theor. Comput. Sci., 2017

Burrows-Wheeler transform and LCP array construction in constant space.
J. Discrete Algorithms, 2017

Preface - Compact Data Structures.
J. Discrete Algorithms, 2017

Document retrieval on repetitive string collections.
Inf. Retr. Journal, 2017

Succinct colored de Bruijn graphs.
Bioinformatics, 2017

Fast and Compact Planar Embeddings.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Efficient Compression and Indexing of Trajectories.
Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
Proceedings of the String Processing and Information Retrieval, 2017

An Encoding for Order-Preserving Matching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Compressed Dynamic Range Majority Data Structures.
Proceedings of the 2017 Data Compression Conference, 2017

A Compact Index for Order-Preserving Pattern Matching.
Proceedings of the 2017 Data Compression Conference, 2017

Path Queries on Functions.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.
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
Dictionary-Based Data Compression.
Encyclopedia of Algorithms, 2016

Rank and Select Operations on Sequences.
Encyclopedia of Algorithms, 2016

Analyzing Relative Lempel-Ziv Reference Construction.
Proceedings of the String Processing and Information Retrieval, 2016

Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.
Proceedings of the String Processing and Information Retrieval, 2016

RLZAP: Relative Lempel-Ziv with Adaptive Pointers.
Proceedings of the String Processing and Information Retrieval, 2016

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

Longest Common Abelian Factors and Large Alphabets.
Proceedings of the String Processing and Information Retrieval, 2016

Bidirectional Variable-Order de Bruijn Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Efficient and Compact Representations of Prefix Codes.
IEEE Trans. Information Theory, 2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

Approximate pattern matching in LZ77-compressed texts.
J. Discrete Algorithms, 2015

Relative Select.
Proceedings of the String Processing and Information Retrieval, 2015

Approximating LZ77 via Small-Space Multiple-Pattern Matching.
Proceedings of the Algorithms - ESA 2015, 2015

Diverse Palindromic Factorization Is NP-complete.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Document Counting in Compressed Space.
Proceedings of the 2015 Data Compression Conference, 2015

Faster Compressed Quadtrees.
Proceedings of the 2015 Data Compression Conference, 2015

Variable-Order de Bruijn Graphs.
Proceedings of the 2015 Data Compression Conference, 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

2014
A subquadratic algorithm for minimum palindromic factorization.
J. Discrete Algorithms, 2014

Efficient Fully-Compressed Sequence Representations.
Algorithmica, 2014

Relative Lempel-Ziv with Constant-Time Random Access.
Proceedings of the String Processing and Information Retrieval, 2014

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

LZ77-Based Self-indexing with Faster Pattern Matching.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Compressed Spaced Suffix Arrays.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

Block Graphs in Practice.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

Relative Lempel-Ziv with Constant-Time Random Access.
Proceedings of the Data Compression Conference, 2014

Indexed Geometric Jumbled Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Colored range queries and document retrieval.
Theor. Comput. Sci., 2013

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

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
Proceedings of the String Processing and Information Retrieval, 2013

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
Proceedings of the Algorithms - ESA 2013, 2013

Document Listing on Repetitive Collections.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

New Algorithms for Position Heaps.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Heaviest Induced Ancestors and Longest Common Substrings.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Value of Multiple Read/Write Streams for Data Compression.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
New algorithms on wavelet trees and applications to information retrieval.
Theor. Comput. Sci., 2012

Bounds from a card trick.
J. Discrete Algorithms, 2012

An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett., 2012

A Note on Sequence Prediction over Large Alphabets.
Algorithms, 2012

Indexed Multi-pattern Matching.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Forbidden Patterns.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Faster Grammar-Based Self-index.
Proceedings of the Language and Automata Theory and Applications, 2012

2011
Tight bounds for online stable sorting.
J. Discrete Algorithms, 2011

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
Discrete Applied Mathematics, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.
Proceedings of the String Processing and Information Retrieval, 2011

Faster Approximate Pattern Matching in Compressed Repetitive Texts.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Counting Colours in Compressed Strings.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
Colored Range Queries and Document Retrieval.
Proceedings of the String Processing and Information Retrieval, 2010

Fast and Compact Prefix Codes.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Lightweight Data Indexing and Compression in External Memory.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Grammar-Based Compression in a Streaming Model.
Proceedings of the Language and Automata Theory and Applications, 2010

Entropy-Bounded Representation of Point Grids.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Better Bouncer's Algorithm.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
New algorithms and lower bounds for sequential access data compression.
PhD thesis, 2009

Compressed depth sequences.
Theor. Comput. Sci., 2009

A New Algorithm for Building Alphabetic Minimax Trees.
Fundam. Inform., 2009

Worst-Case Optimal Adaptive Prefix Coding.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Range Quantile Queries: Another Virtue of Wavelet Trees.
Proceedings of the String Processing and Information Retrieval, 2009

Minimax Trees in Linear Time with Applications.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Low-Memory Adaptive Prefix Coding.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Minimax Trees in Linear Time with Applications.
Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

On the Value of Multiple Read/Write Streams for Data Compression.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Dictionary-Based Data Compression.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Space-Conscious Compression.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Sorting streamed multisets.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Move-to-Front, Distance Coding, and Inversion Frequencies Revisited.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Large alphabets and incompressibility.
Inf. Process. Lett., 2006

Compressing probability distributions.
Inf. Process. Lett., 2006

Dynamic Asymmetric Communication.
Proceedings of the Structural Information and Communication Complexity, 2006

Dynamic Asymmetric Communication.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Restructuring binary search trees revisited.
Inf. Process. Lett., 2005

2004
Dynamic Shannon Coding.
Proceedings of the Algorithms, 2004

Dynamic Shannon Coding.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
New Ways to Construct Binary Search Trees.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003


  Loading...