| Publication | Date of Publication | Type |
|---|
| Compressibility measures for two-dimensional data | 2024-05-29 | Paper |
| Rpair: rescaling RePair with Rsync | 2024-04-19 | Paper |
| Inducing the Lyndon array | 2024-04-19 | Paper |
| Space-efficient merging of succinct de Bruijn graphs | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187832 | 2024-01-15 | Paper |
| A new class of string transformations for compressed text indexing | 2023-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6133881 | 2023-07-24 | Paper |
| Global strategies for augmenting the efficiency of TSP heuristics | 2023-01-18 | Paper |
| Practical Random Access to SLP-Compressed Texts | 2022-12-22 | Paper |
| On ergodic linear cellular automata over Zm | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090335 | 2022-07-18 | Paper |
| A new class of searchable and provably highly compressible string transformations | 2022-07-18 | Paper |
| Prefix-Free Parsing for Building Big BWTs | 2022-07-18 | Paper |
| Space efficient merging of de Bruijn graphs and Wheeler graphs | 2022-03-22 | Paper |
| Efficient and compact representations of some non-canonical prefix-free codes | 2022-02-21 | Paper |
| Lightweight BWT and LCP Merging via the Gap Algorithm | 2021-02-16 | Paper |
| PFP Compressed Suffix Trees | 2021-01-27 | Paper |
| An Encoding for Order-Preserving Matching. | 2020-05-27 | Paper |
| Lightweight merging of compressed indices based on BWT variants | 2020-02-20 | Paper |
| The alternating BWT: an algorithmic perspective | 2020-02-20 | Paper |
| Efficient construction of a complete index for pan-genomics read alignment | 2019-05-21 | Paper |
| Lyndon array construction during Burrows-Wheeler inversion | 2018-12-14 | Paper |
| Block sorting-based transformations on words: beyond the magic BWT | 2018-11-22 | Paper |
| XBWT tricks | 2018-10-17 | Paper |
| Efficient and compact representations of some non-canonical prefix-free codes | 2018-10-17 | Paper |
| A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643887 | 2018-05-29 | Paper |
| Parallel complexity of householder QR factorization | 2017-12-05 | Paper |
| Wheeler graphs: a framework for BWT-based data structures | 2017-11-06 | Paper |
| Compressed spaced suffix arrays | 2017-07-17 | Paper |
| An analysis of the Burrows—Wheeler transform | 2015-10-30 | Paper |
| Longest Common Prefix with Mismatches | 2015-10-02 | Paper |
| Compressed representations of sequences and full-text indexes | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501323 | 2015-08-03 | Paper |
| Spaced Seed Design Using Perfect Rulers | 2014-05-12 | Paper |
| Better spaced seeds using quadratic residues | 2014-01-27 | Paper |
| Design and analysis of periodic multiple seeds | 2014-01-24 | Paper |
| Lightweight data indexing and compression in external memory | 2012-04-26 | Paper |
| Move-to-front, distance coding, and inversion frequencies revisited | 2010-07-07 | Paper |
| Lightweight Data Indexing and Compression in External Memory | 2010-04-27 | Paper |
| Succinct representations of trees | 2009-12-11 | Paper |
| The myriad virtues of wavelet trees | 2009-07-15 | Paper |
| Permuted Longest-Common-Prefix Array | 2009-07-07 | Paper |
| The Myriad Virtues of Wavelet Trees | 2009-03-12 | Paper |
| Indexing compressed text | 2008-12-21 | Paper |
| Boosting textual compression in optimal linear time | 2008-12-21 | Paper |
| Space-Conscious Compression | 2008-09-17 | Paper |
| Move-to-Front, Distance Coding, and Inversion Frequencies Revisited | 2008-06-17 | Paper |
| The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression | 2008-03-11 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Engineering a lightweight suffix array construction algorithm | 2004-10-01 | Paper |
| On computing the entropy of cellular automata. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411402 | 2003-07-08 | Paper |
| Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) | 2003-05-25 | Paper |
| \(\text{BIDA}^*\): An improved perimeter search algorithm | 2003-02-04 | Paper |
| An experimental study of an opportunistic index | 2003-01-14 | Paper |
| An experimental study of a compressed index | 2001-10-10 | Paper |
| Inversion of circulant matrices over \(\mathbf{Z}_m\) | 2001-05-14 | Paper |
| Matrix rank and communication complexity | 2001-01-03 | Paper |
| Finding exact solutions to the bandwidth minimization problem | 2000-10-17 | Paper |
| Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\) | 2000-08-23 | Paper |
| Compression of Low Entropy Strings with Lempel--Ziv Algorithms | 2000-03-19 | Paper |
| A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836539 | 1999-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699313 | 1999-11-10 | Paper |
| Attractors of linear cellular automata | 1999-11-09 | Paper |
| Parallel Complexity of Numerically Accurate Linear System Solvers | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218157 | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252346 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219049 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941887 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219041 | 1998-11-15 | Paper |
| Lyapunov exponent versus expansivity and sensitivity in cellular automata | 1998-11-11 | Paper |
| Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects | 1998-10-13 | Paper |
| On the randomized error of polynomial methods for eigenvector and eigenvalue estimates | 1998-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381386 | 1998-04-01 | Paper |
| On the ordering of sparse linear systems | 1997-09-09 | Paper |
| Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP | 1997-07-06 | Paper |
| On the ordering of sparse linear systems | 1997-02-27 | Paper |
| Algebraic techniques in communication complexity | 1997-02-27 | Paper |
| Minimal residual algorithm and matrix-vector information | 1996-12-19 | Paper |
| Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results | 1994-12-11 | Paper |
| Sparse matrix computations on the hypercube and related networks | 1994-12-11 | Paper |
| Radix sort on the hypercube | 1992-06-26 | Paper |
| The landscape of compressibility measures for two-dimensional data | N/A | Paper |
