| Publication | Date of Publication | Type |
|---|
| Phase transition in count approximation by count-min sketch with conservative updates | 2023-10-04 | Paper |
| Space-Efficient Representation of Genomic k-Mer Count Tables | 2023-07-24 | Paper |
| Decidability of regularity and related properties of ground normal form languages | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874429 | 2023-02-07 | Paper |
| Optimal reconstruction of graphs under the additive model | 2021-12-20 | Paper |
| Absent words in a sliding window with applications | 2020-01-17 | Paper |
| Optimal bounds for computing \({\alpha}\)-gapped repeats | 2019-09-17 | Paper |
| Minimal absent words in a sliding window and applications to on-line pattern matching | 2017-11-22 | Paper |
| Full-fledged real-time indexing for constant size alphabets | 2017-10-10 | Paper |
| Approximate string matching using a bidirectional index | 2016-06-16 | Paper |
| Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats | 2016-04-13 | Paper |
| Computing the Longest Unbordered Substring | 2015-10-02 | Paper |
| On Maximal Unbordered Factors | 2015-08-20 | Paper |
| On-line construction of position heaps | 2014-08-13 | Paper |
| Cross-document pattern matching | 2014-08-13 | Paper |
| Algorithms for path-constrained sequence alignment | 2014-08-13 | Paper |
| Approximate String Matching Using a Bidirectional Index | 2014-06-30 | Paper |
| On the combinatorics of suffix arrays | 2014-04-14 | Paper |
| Prefix Table Construction and Conversion | 2014-01-17 | Paper |
| Minimal Discriminating Words Problem Revisited | 2013-10-29 | Paper |
| Full-fledged real-time indexing for constant size alphabets | 2013-08-06 | Paper |
| Computing Discriminating and Generic Words | 2013-04-08 | Paper |
| Cross-Document Pattern Matching | 2012-08-14 | Paper |
| Designing Efficient Spaced Seeds for SOLiD Read Mapping | 2011-05-24 | Paper |
| Regular Language Constrained Sequence Alignment Revisited | 2011-05-19 | Paper |
| On maximal repetitions of arbitrary exponent | 2010-09-07 | Paper |
| Searching for gapped palindromes | 2009-11-18 | Paper |
| Searching for Gapped Palindromes | 2008-06-17 | Paper |
| Subset Seed Automaton | 2008-06-10 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Optimal Linear Arrangement of Interval Graphs | 2007-09-05 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Linear-time computation of local periods | 2005-01-11 | Paper |
| Finding approximate repetitions under Hamming distance. | 2003-08-17 | Paper |
| How many square occurrences must a binary sequence contain? | 2003-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796175 | 2003-03-02 | Paper |
| The complexity of some complementation problems | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511317 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511275 | 2000-10-30 | Paper |
| Optimal reconstruction of graphs under the additive model | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954448 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934345 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699311 | 1999-11-10 | Paper |
| On repetition-free binary words of minimal density | 1999-06-21 | Paper |
| Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252407 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218146 | 1999-03-02 | Paper |
| Matching a set of strings with variable length don't cares | 1998-07-22 | Paper |
| Undecidability of ground reducibility for word rewriting systems with variables | 1997-02-28 | Paper |
| Valentin Antimirov (1961--1995) | 1997-02-27 | Paper |
| Decidability of regularity and related properties of ground normal form languages | 1995-05-28 | Paper |
