| Publication | Date of Publication | Type |
|---|
| Better space-time-robustness trade-offs for set reconciliation | 2026-01-14 | Paper |
| Improving the sensitivity of MinHash through hash-value analysis | 2024-10-21 | Paper |
| Efficient reconciliation of genomic datasets of high similarity | 2024-08-13 | Paper |
| Count-min sketch with variable number of hash functions: an experimental study | 2024-05-29 | Paper |
Phase transition in count approximation by count-min sketch with conservative updates
Lecture Notes in Computer Science | 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
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
scientific article; zbMATH DE number 7651095 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Optimal reconstruction of graphs under the additive model
Algorithms — ESA '97 | 2021-12-20 | Paper |
Absent words in a sliding window with applications
Information and Computation | 2020-01-17 | Paper |
Optimal bounds for computing \({\alpha}\)-gapped repeats
Information and Computation | 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
Algorithmica | 2017-10-10 | Paper |
Approximate string matching using a bidirectional index
Theoretical Computer Science | 2016-06-16 | Paper |
Optimal bounds for computing \(\alpha\)-gapped repeats
Language and Automata Theory and Applications | 2016-04-13 | Paper |
| Computing the Longest Unbordered Substring | 2015-10-02 | Paper |
On maximal unbordered factors
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On-line construction of position heaps
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Cross-document pattern matching
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Algorithms for path-constrained sequence alignment
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Approximate String Matching Using a Bidirectional Index
Combinatorial Pattern Matching | 2014-06-30 | Paper |
On the combinatorics of suffix arrays
Information Processing Letters | 2014-04-14 | Paper |
Prefix table construction and conversion
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Minimal Discriminating Words Problem Revisited
String Processing and Information Retrieval | 2013-10-29 | Paper |
Full-fledged real-time indexing for constant size alphabets
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Computing discriminating and generic words
String Processing and Information Retrieval | 2013-04-08 | Paper |
Cross-document pattern matching
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Designing efficient spaced seeds for SOLiD read mapping
Advances in Bioinformatics | 2011-05-24 | Paper |
Regular language constrained sequence alignment revisited
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On maximal repetitions of arbitrary exponent
Information Processing Letters | 2010-09-07 | Paper |
Searching for gapped palindromes
Theoretical Computer Science | 2009-11-18 | Paper |
Searching for Gapped Palindromes
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Subset Seed Automaton
Implementation and Application of Automata | 2008-06-10 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Optimal Linear Arrangement of Interval Graphs
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Linear-time computation of local periods
Theoretical Computer Science | 2005-01-11 | Paper |
Finding approximate repetitions under Hamming distance.
Theoretical Computer Science | 2003-08-17 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
| scientific article; zbMATH DE number 1875416 (Why is no real title available?) | 2003-03-02 | Paper |
The complexity of some complementation problems
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1523042 (Why is no real title available?) | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1523000 (Why is no real title available?) | 2000-10-30 | Paper |
Optimal reconstruction of graphs under the additive model
Algorithmica | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1456959 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1390079 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1361493 (Why is no real title available?) | 1999-11-10 | Paper |
On repetition-free binary words of minimal density
Theoretical Computer Science | 1999-06-21 | Paper |
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
Discrete Applied Mathematics | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 1305516 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1222604 (Why is no real title available?) | 1999-03-02 | Paper |
Matching a set of strings with variable length don't cares
Theoretical Computer Science | 1998-07-22 | Paper |
Undecidability of ground reducibility for word rewriting systems with variables
Information Processing Letters | 1997-02-28 | Paper |
Valentin Antimirov (1961--1995)
Theoretical Computer Science | 1997-02-27 | Paper |
Decidability of regularity and related properties of ground normal form languages
Information and Computation | 1995-05-28 | Paper |
