| Publication | Date of Publication | Type |
|---|
Acceleration of FM-index queries through prefix-free parsing
| 2024-12-09 | Paper |
MONI can find \(k\)-MEMs
| 2024-10-21 | Paper |
Sum-of-local-effects data structures for separable graphs
| 2024-08-22 | Paper |
Space-efficient conversions from SLPs
| 2024-05-31 | Paper |
Wheeler maps
| 2024-05-31 | Paper |
Dynamic compact planar embeddings
| 2024-05-29 | Paper |
A simple grammar-based index for finding approximately longest common substrings
| 2024-05-29 | Paper |
Data structures for SMEM-finding in the PBWT
| 2024-05-29 | Paper |
Space-time trade-offs for the LCP array of Wheeler DFAs
| 2024-05-29 | Paper |
Rpair: rescaling RePair with Rsync
| 2024-04-19 | Paper |
Faster dynamic compressed \(d\)-ary relations
| 2024-04-19 | Paper |
On representing the degree sequences of sublogarithmic-degree Wheeler graphs
String Processing and Information Retrieval | 2023-08-04 | Paper |
scientific article; zbMATH DE number 7716299 (Why is no real title available?)
| 2023-07-24 | Paper |
Ruler Wrapping
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
scientific article; zbMATH DE number 7695999 (Why is no real title available?)
| 2023-06-14 | Paper |
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
Lecture Notes in Computer Science | 2023-03-09 | Paper |
Practical Random Access to SLP-Compressed Texts
1523.68029 | 2022-12-22 | Paper |
Faster compressed quadtrees
Journal of Computer and System Sciences | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7561422 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559194 (Why is no real title available?)
| 2022-07-18 | Paper |
Prefix-free parsing for building big BWTs
| 2022-07-18 | Paper |
Efficient and compact representations of some non-canonical prefix-free codes
Theoretical Computer Science | 2022-02-21 | Paper |
Range majorities and minorities in arrays
Algorithmica | 2021-06-11 | Paper |
On two LZ78-style grammars: compression bounds and compressed-space computation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Efficient compression and indexing of trajectories
String Processing and Information Retrieval | 2021-02-16 | Paper |
Block trees
Journal of Computer and System Sciences | 2021-02-02 | Paper |
PFP Compressed Suffix Trees
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Maximal unbordered factors of random strings
Theoretical Computer Science | 2021-01-25 | Paper |
Online LZ77 parsing and matching statistics with RLBWTs
| 2020-12-16 | Paper |
Fully functional suffix trees and optimal text searching in BWT-runs bounded space
Journal of the ACM | 2020-11-11 | Paper |
Fast and compact planar embeddings
Computational Geometry | 2020-10-23 | Paper |
Tree path majority data structures
Theoretical Computer Science | 2020-08-03 | Paper |
An encoding for order-preserving matching
| 2020-05-27 | Paper |
Fast and simple jumbled indexing for binary run-length encoded strings
| 2020-05-25 | Paper |
Path queries on functions
| 2020-05-25 | Paper |
Compressed dynamic range majority and minority data structures
Algorithmica | 2020-05-21 | Paper |
Refining the \(r\)-index
Theoretical Computer Science | 2020-02-20 | Paper |
On the approximation ratio of Lempel-Ziv parsing
| 2020-02-12 | Paper |
Sparse dynamic programming on DAGs with small width
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Bidirectional Variable-Order de Bruijn Graphs
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Efficient construction of a complete index for pan-genomics read alignment
| 2019-05-21 | Paper |
Path queries on functions
Theoretical Computer Science | 2019-05-02 | Paper |
A note on sequence prediction over large alphabets
Algorithms | 2019-03-26 | Paper |
A separation between RLSLPs and LZ77
Journal of Discrete Algorithms | 2018-12-14 | Paper |
RLZAP: relative Lempel-Ziv with adaptive pointers
| 2018-10-17 | Paper |
Fully dynamic de Bruijn graphs
| 2018-10-17 | Paper |
Analyzing relative Lempel-Ziv reference construction
| 2018-10-17 | Paper |
Longest common abelian factors and large alphabets
| 2018-10-17 | Paper |
Efficient and compact representations of some non-canonical prefix-free codes
String Processing and Information Retrieval | 2018-10-17 | Paper |
Diverse Palindromic Factorization is NP-Complete
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
scientific article; zbMATH DE number 6850405 (Why is no real title available?)
| 2018-03-15 | Paper |
Wheeler graphs: a framework for BWT-based data structures
Theoretical Computer Science | 2017-11-06 | Paper |
String cadences
Theoretical Computer Science | 2017-11-06 | Paper |
Fast and compact planar embeddings
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Flexible indexing of repetitive collections
| 2017-08-04 | Paper |
Block graphs in practice
Mathematics in Computer Science | 2017-07-17 | Paper |
Compressed spaced suffix arrays
Mathematics in Computer Science | 2017-07-17 | Paper |
Efficient and Compact Representations of Prefix Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Burrows-Wheeler transform and LCP array construction in constant space
Journal of Discrete Algorithms | 2017-02-14 | Paper |
Hybrid indexes for repetitive datasets
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Bidirectional variable-order de Bruijn graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Algorithmica | 2015-11-19 | Paper |
Approximating LZ77 via Small-Space Multiple-Pattern Matching
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Diverse Palindromic Factorization Is NP-complete
Developments in Language Theory | 2015-11-10 | Paper |
Composite repetition-aware data structures
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Approximate pattern matching in LZ77-compressed texts
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Relative Lempel-Ziv with constant-time random access
String Processing and Information Retrieval | 2015-02-10 | Paper |
Efficient fully-compressed sequence representations
Algorithmica | 2014-11-19 | Paper |
A subquadratic algorithm for minimum palindromic factorization
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Indexed geometric jumbled pattern matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
LZ77-based self-indexing with faster pattern matching
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Colored range queries and document retrieval
Theoretical Computer Science | 2014-01-09 | Paper |
Entropy-bounded representation of point grids
Computational Geometry | 2014-01-08 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Better space bounds for parameterized range majority and minority
Lecture Notes in Computer Science | 2013-08-12 | Paper |
New algorithms for position heaps
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Document listing on repetitive collections
Combinatorial Pattern Matching | 2013-06-14 | Paper |
On the value of multiple read/write streams for data compression
Lecture Notes in Computer Science | 2013-04-09 | Paper |
Minimax trees in linear time with applications
European Journal of Combinatorics | 2012-11-15 | Paper |
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters | 2012-10-23 | Paper |
Forbidden patterns
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Indexed multi-pattern matching
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
A faster grammar-based self-index
Language and Automata Theory and Applications | 2012-06-08 | Paper |
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science | 2012-05-30 | Paper |
Bounds from a card trick
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Lightweight data indexing and compression in external memory
Algorithmica | 2012-04-26 | Paper |
Faster approximate pattern matching in compressed repetitive texts
Algorithms and Computation | 2011-12-16 | Paper |
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
Discrete Applied Mathematics | 2011-08-10 | Paper |
Tight bounds for online stable sorting
Journal of Discrete Algorithms | 2011-07-29 | Paper |
Counting Colours in Compressed Strings
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Alphabet partitioning for compressed rank/select and applications
Algorithms and Computation | 2010-12-09 | Paper |
Entropy-bounded representation of point grids
Algorithms and Computation | 2010-12-09 | Paper |
Move-to-front, distance coding, and inversion frequencies revisited
Theoretical Computer Science | 2010-07-07 | Paper |
Dynamic asymmetric communication
Information Processing Letters | 2010-06-09 | Paper |
Sorting streamed multisets
Information Processing Letters | 2010-06-09 | Paper |
Grammar-Based Compression in a Streaming Model
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Lightweight data indexing and compression in external memory
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
A new algorithm for building alphabetic minimax trees
Fundamenta Informaticae | 2010-02-05 | Paper |
Large alphabets and incompressibility
Information Processing Letters | 2010-01-29 | Paper |
Dynamic Shannon coding
Information Processing Letters | 2010-01-29 | Paper |
Fast and Compact Prefix Codes
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Compressing probability distributions
Information Processing Letters | 2009-12-18 | Paper |
Minimax Trees in Linear Time with Applications
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Restructuring binary search trees revisited
Information Processing Letters | 2009-12-04 | Paper |
Worst-Case Optimal Adaptive Prefix Coding
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Compressed depth sequences
Theoretical Computer Science | 2009-03-17 | Paper |
Dynamic Asymmetric Communication
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Space-Conscious Compression
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On the value of multiple read/write streams for data compression
Lecture Notes in Computer Science | 0001-01-03 | Paper |
