| 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 |
scientific article; zbMATH DE number 7788637 (Why is no real title available?)
| 2024-01-15 | Paper |
A new class of string transformations for compressed text indexing
Information and Computation | 2023-09-27 | Paper |
scientific article; zbMATH DE number 7716299 (Why is no real title available?)
| 2023-07-24 | Paper |
Global strategies for augmenting the efficiency of TSP heuristics
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Practical Random Access to SLP-Compressed Texts
1523.68029 | 2022-12-22 | Paper |
On ergodic linear cellular automata over \(\mathbf{Z}_m\)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
External memory BWT and LCP computation for sequence collections with applications
| 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
Algorithmica | 2022-03-22 | Paper |
Efficient and compact representations of some non-canonical prefix-free codes
Theoretical Computer Science | 2022-02-21 | Paper |
Lightweight BWT and LCP merging via the gap algorithm
String Processing and Information Retrieval | 2021-02-16 | Paper |
PFP Compressed Suffix Trees
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
An encoding for order-preserving matching
| 2020-05-27 | Paper |
Lightweight merging of compressed indices based on BWT variants
Theoretical Computer Science | 2020-02-20 | Paper |
The alternating BWT: an algorithmic perspective
Theoretical Computer Science | 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
Journal of Discrete Algorithms | 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
String Processing and Information Retrieval | 2018-10-17 | Paper |
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
Automata, Languages and Programming | 2018-07-04 | Paper |
scientific article; zbMATH DE number 6876115 (Why is no real title available?)
| 2018-05-29 | Paper |
Parallel complexity of Householder QR factorization
Algorithms — ESA '96 | 2017-12-05 | Paper |
Wheeler graphs: a framework for BWT-based data structures
Theoretical Computer Science | 2017-11-06 | Paper |
Compressed spaced suffix arrays
Mathematics in Computer Science | 2017-07-17 | Paper |
An analysis of the Burrows-Wheeler transform
Journal of the ACM | 2015-10-30 | Paper |
Longest common prefix with mismatches
String Processing and Information Retrieval | 2015-10-02 | Paper |
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Compression boosting in optimal linear time using the Burrows-Wheeler transform
| 2015-08-03 | Paper |
Spaced seed design using perfect rulers
Fundamenta Informaticae | 2014-05-12 | Paper |
Better spaced seeds using quadratic residues
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Design and analysis of periodic multiple seeds
Theoretical Computer Science | 2014-01-24 | Paper |
Lightweight data indexing and compression in external memory
Algorithmica | 2012-04-26 | Paper |
Move-to-front, distance coding, and inversion frequencies revisited
Theoretical Computer Science | 2010-07-07 | Paper |
Lightweight data indexing and compression in external memory
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Succinct representations of trees
Lecture Notes in Computer Science | 2009-12-11 | Paper |
The myriad virtues of wavelet trees
Information and Computation | 2009-07-15 | Paper |
Permuted Longest-Common-Prefix Array
Combinatorial Pattern Matching | 2009-07-07 | Paper |
The Myriad Virtues of Wavelet Trees
Automata, Languages and Programming | 2009-03-12 | Paper |
Indexing compressed text
Journal of the ACM | 2008-12-21 | Paper |
Boosting textual compression in optimal linear time
Journal of the ACM | 2008-12-21 | 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 |
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
Lecture Notes in Computer Science | 2008-03-11 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Engineering a lightweight suffix array construction algorithm
Algorithmica | 2004-10-01 | Paper |
On computing the entropy of cellular automata.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1947433 (Why is no real title available?)
| 2003-07-08 | Paper |
Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\)
Linear Algebra and its Applications | 2003-05-25 | Paper |
\(\text{BIDA}^*\): An improved perimeter search algorithm
Artificial Intelligence | 2003-02-04 | Paper |
An experimental study of an opportunistic index
| 2003-01-14 | Paper |
An experimental study of a compressed index
Information Sciences | 2001-10-10 | Paper |
Inversion of circulant matrices over \(\mathbf{Z}_m\)
Mathematics of Computation | 2001-05-14 | Paper |
Matrix rank and communication complexity
Linear Algebra and its Applications | 2001-01-03 | Paper |
Finding exact solutions to the bandwidth minimization problem
Computing | 2000-10-17 | Paper |
Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
Theoretical Computer Science | 2000-08-23 | Paper |
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
SIAM Journal on Computing | 2000-03-19 | Paper |
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
Theoretical Computer Science | 2000-01-12 | Paper |
scientific article; zbMATH DE number 1375602 (Why is no real title available?)
| 1999-12-09 | Paper |
scientific article; zbMATH DE number 1361495 (Why is no real title available?)
| 1999-11-10 | Paper |
Attractors of linear cellular automata
Journal of Computer and System Sciences | 1999-11-09 | Paper |
Parallel Complexity of Numerically Accurate Linear System Solvers
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1222614 (Why is no real title available?)
| 1999-08-23 | Paper |
scientific article; zbMATH DE number 1305460 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1223733 (Why is no real title available?)
| 1999-02-14 | Paper |
scientific article; zbMATH DE number 1418325 (Why is no real title available?)
| 1999-01-01 | Paper |
scientific article; zbMATH DE number 1223725 (Why is no real title available?)
| 1998-11-15 | Paper |
Lyapunov exponent versus expansivity and sensitivity in cellular automata
Journal of Complexity | 1998-11-11 | Paper |
Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
Journal of Computer and System Sciences | 1998-10-13 | Paper |
On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
Journal of Complexity | 1998-05-25 | Paper |
scientific article; zbMATH DE number 1136075 (Why is no real title available?)
| 1998-04-01 | Paper |
On the ordering of sparse linear systems
Theoretical Computer Science | 1997-09-09 | Paper |
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
INFORMS Journal on Computing | 1997-07-06 | Paper |
On the ordering of sparse linear systems
Theoretical Computer Science | 1997-02-27 | Paper |
Algebraic techniques in communication complexity
Information Processing Letters | 1997-02-27 | Paper |
Minimal residual algorithm and matrix-vector information
Computers & Mathematics with Applications | 1996-12-19 | Paper |
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
Information Processing Letters | 1994-12-11 | Paper |
Sparse matrix computations on the hypercube and related networks
Journal of Parallel and Distributed Computing | 1994-12-11 | Paper |
Radix sort on the hypercube
Information Processing Letters | 1992-06-26 | Paper |
The landscape of compressibility measures for two-dimensional data
| N/A | Paper |
