Publication | Date of Publication | Type |
---|
On representing the degree sequences of sublogarithmic-degree Wheeler graphs | 2023-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q6133881 | 2023-07-24 | Paper |
Ruler Wrapping | 2023-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q6098784 | 2023-06-14 | Paper |
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended | 2023-03-09 | Paper |
Faster compressed quadtrees | 2022-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5091063 | 2022-07-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5088917 | 2022-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5090326 | 2022-07-18 | Paper |
Efficient and compact representations of some non-canonical prefix-free codes | 2022-02-21 | Paper |
Range majorities and minorities in arrays | 2021-06-11 | Paper |
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation | 2021-02-16 | Paper |
Efficient Compression and Indexing of Trajectories | 2021-02-16 | Paper |
Block trees | 2021-02-02 | Paper |
PFP Compressed Suffix Trees | 2021-01-27 | Paper |
Maximal unbordered factors of random strings | 2021-01-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5140769 | 2020-12-16 | Paper |
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space | 2020-11-11 | Paper |
Fast and compact planar embeddings | 2020-10-23 | Paper |
Tree path majority data structures | 2020-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111725 | 2020-05-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5110868 | 2020-05-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5110883 | 2020-05-25 | Paper |
Compressed dynamic range majority and minority data structures | 2020-05-21 | Paper |
Refining the \(r\)-index | 2020-02-20 | Paper |
On the approximation ratio of Lempel-Ziv parsing | 2020-02-12 | Paper |
Sparse Dynamic Programming on DAGs with Small Width | 2019-11-25 | Paper |
Bidirectional Variable-Order de Bruijn Graphs | 2019-06-24 | Paper |
Efficient construction of a complete index for pan-genomics read alignment | 2019-05-21 | Paper |
Path queries on functions | 2019-05-02 | Paper |
A note on sequence prediction over large alphabets | 2019-03-26 | Paper |
A separation between RLSLPs and LZ77 | 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 | 2018-10-17 | Paper |
Maximal unbordered factors of random strings | 2018-10-17 | Paper |
Diverse Palindromic Factorization is NP-Complete | 2018-05-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4607985 | 2018-03-15 | Paper |
String cadences | 2017-11-06 | Paper |
Wheeler graphs: a framework for BWT-based data structures | 2017-11-06 | Paper |
Fast and compact planar embeddings | 2017-09-22 | Paper |
Flexible indexing of repetitive collections | 2017-08-04 | Paper |
Compressed spaced suffix arrays | 2017-07-17 | Paper |
Block graphs in practice | 2017-07-17 | Paper |
Efficient and Compact Representations of Prefix Codes | 2017-04-28 | Paper |
Burrows-Wheeler transform and LCP array construction in constant space | 2017-02-14 | Paper |
Hybrid indexes for repetitive datasets | 2017-01-13 | Paper |
Bidirectional Variable-Order de Bruijn Graphs | 2016-05-03 | Paper |
Binary jumbled pattern matching on trees and tree-like structures | 2015-11-19 | Paper |
Approximating LZ77 via Small-Space Multiple-Pattern Matching | 2015-11-19 | Paper |
Diverse Palindromic Factorization Is NP-complete | 2015-11-10 | Paper |
Composite Repetition-Aware Data Structures | 2015-08-20 | Paper |
Approximate pattern matching in LZ77-compressed texts | 2015-05-04 | Paper |
Relative Lempel-Ziv with Constant-Time Random Access | 2015-02-10 | Paper |
Efficient fully-compressed sequence representations | 2014-11-19 | Paper |
A subquadratic algorithm for minimum palindromic factorization | 2014-09-05 | Paper |
Indexed Geometric Jumbled Pattern Matching | 2014-06-30 | Paper |
LZ77-Based Self-indexing with Faster Pattern Matching | 2014-03-31 | Paper |
Colored range queries and document retrieval | 2014-01-09 | Paper |
Entropy-bounded representation of point grids | 2014-01-08 | Paper |
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures | 2013-09-17 | Paper |
Better Space Bounds for Parameterized Range Majority and Minority | 2013-08-12 | Paper |
New Algorithms for Position Heaps | 2013-06-14 | Paper |
Document Listing on Repetitive Collections | 2013-06-14 | Paper |
On the Value of Multiple Read/Write Streams for Data Compression | 2013-04-09 | Paper |
Minimax trees in linear time with applications | 2012-11-15 | Paper |
An efficient algorithm to test square-freeness of strings compressed by straight-line programs | 2012-10-23 | Paper |
Forbidden Patterns | 2012-06-29 | Paper |
Indexed Multi-pattern Matching | 2012-06-29 | Paper |
A Faster Grammar-Based Self-index | 2012-06-08 | Paper |
New algorithms on wavelet trees and applications to information retrieval | 2012-05-30 | Paper |
Bounds from a card trick | 2012-05-11 | Paper |
Lightweight data indexing and compression in external memory | 2012-04-26 | Paper |
Faster Approximate Pattern Matching in Compressed Repetitive Texts | 2011-12-16 | Paper |
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case | 2011-08-10 | Paper |
Tight bounds for online stable sorting | 2011-07-29 | Paper |
Counting Colours in Compressed Strings | 2011-06-29 | Paper |
Alphabet Partitioning for Compressed Rank/Select and Applications | 2010-12-09 | Paper |
Entropy-Bounded Representation of Point Grids | 2010-12-09 | Paper |
Move-to-front, distance coding, and inversion frequencies revisited | 2010-07-07 | Paper |
Dynamic asymmetric communication | 2010-06-09 | Paper |
Sorting streamed multisets | 2010-06-09 | Paper |
Grammar-Based Compression in a Streaming Model | 2010-05-26 | Paper |
Lightweight Data Indexing and Compression in External Memory | 2010-04-27 | Paper |
A New Algorithm for Building Alphabetic Minimax Trees | 2010-02-05 | Paper |
Large alphabets and incompressibility | 2010-01-29 | Paper |
Dynamic Shannon coding | 2010-01-29 | Paper |
Fast and Compact Prefix Codes | 2010-01-28 | Paper |
Compressing probability distributions | 2009-12-18 | Paper |
Minimax Trees in Linear Time with Applications | 2009-12-11 | Paper |
Restructuring binary search trees revisited | 2009-12-04 | Paper |
Worst-Case Optimal Adaptive Prefix Coding | 2009-10-20 | Paper |
Algorithms and Computation | 2009-08-07 | Paper |
On the Value of Multiple Read/Write Streams for Data Compression | 2009-07-07 | Paper |
Compressed depth sequences | 2009-03-17 | Paper |
Dynamic Asymmetric Communication | 2009-03-12 | Paper |
Space-Conscious Compression | 2008-09-17 | Paper |
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited | 2008-06-17 | Paper |
Algorithms – ESA 2004 | 2005-08-18 | Paper |