| Publication | Date of Publication | Type |
|---|
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
Acta Informatica | 2024-11-07 | Paper |
| Efficient parameterized pattern matching in sublinear space | 2024-05-29 | Paper |
| Parallel algorithm for pattern matching problems under substring consistent equivalence relations | 2024-05-06 | Paper |
Inferring strings from position heaps in linear time
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Computing the parameterized Burrows-Wheeler transform online
String Processing and Information Retrieval | 2023-08-04 | Paper |
Linear-time online algorithm inferring the shortest path from a walk
Lecture Notes in Computer Science | 2023-07-28 | Paper |
| Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences | 2023-02-07 | Paper |
In-place bijective burrows-wheeler transforms
(available as arXiv preprint) | 2023-02-07 | Paper |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
(available as arXiv preprint) | 2023-02-07 | Paper |
| DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures | 2023-02-07 | Paper |
Computing Covers Under Substring Consistent Equivalence Relations
1511.68351 | 2022-12-22 | Paper |
On the hardness of approximating the minimum consistent OBDD problem
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Parameterized DAWGs: efficient constructions and bidirectional pattern searches
Theoretical Computer Science | 2022-09-27 | Paper |
| scientific article; zbMATH DE number 7453082 (Why is no real title available?) | 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453082 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
Filtering multi-set tree: data structure for flexible matching using multi-track data
Interdisciplinary Information Sciences | 2020-11-19 | Paper |
Duel and sweep algorithm for order-preserving pattern matching
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
New variants of pattern matching with constants and variables
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Parallel duel-and-sweep algorithm for the order-preserving pattern matching
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Position heaps for parameterized strings
(available as arXiv preprint) | 2020-05-25 | Paper |
Efficient computation of longest single-arm-gapped palindromes in a string
Theoretical Computer Science | 2020-02-20 | Paper |
Linear-time online algorithm for inferring the shortest path graph from a walk label
Theoretical Computer Science | 2020-02-20 | Paper |
Efficient dynamic dictionary matching with DAWGs and AC-automata
Theoretical Computer Science | 2019-10-07 | Paper |
Permuted pattern matching algorithms on multi-track strings
Algorithms | 2019-07-08 | Paper |
| scientific article; zbMATH DE number 6999904 (Why is no real title available?) | 2019-01-10 | Paper |
Enumeration of cryptarithms using deterministic finite automata
(available as arXiv preprint) | 2018-11-07 | Paper |
| AC-automaton update algorithm for semi-dynamic dictionary matching | 2018-10-17 | Paper |
Linear-time text compression by longest-first substitution
Algorithms | 2018-08-20 | Paper |
Functional programs as compressed data
Higher-Order and Symbolic Computation | 2017-05-15 | Paper |
Compact bit encoding schemes for simply-typed lambda-terms
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Computing longest single-arm-gapped palindromes in a string
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Longest common subsequence in at least \(k\) length order-isomorphic substrings
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Average number of occurrences of repetitions in a necklace
Discrete Applied Mathematics | 2015-09-22 | Paper |
Detecting regularities on grammar-compressed strings
Information and Computation | 2015-01-30 | Paper |
Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Permuted Pattern Matching on Multi-track Strings
Lecture Notes in Computer Science | 2014-11-04 | Paper |
An efficient algorithm to test square-freeness of strings compressed by balanced straight line programs
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Detecting regularities on grammar-compressed strings
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Ternary directed acyclic word graphs
Implementation and Application of Automata | 2010-05-07 | Paper |
Linear-time off-line text compression by longest-first substitution.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
The size of subsequence automaton.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Average value of sum of exponents of runs in a string
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
A Series of Run-Rich Strings
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science | 2009-03-17 | Paper |
Computing Longest Common Substring and All Palindromes from Compressed Strings
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
Information Processing Letters | 2006-01-17 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
The size of subsequence automaton
Theoretical Computer Science | 2005-09-22 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2185630 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185628 (Why is no real title available?) | 2005-07-04 | Paper |
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
Ternary directed acyclic word graphs
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2086339 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087051 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2084855 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2084853 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2081034 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077179 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2052914 (Why is no real title available?) | 2004-03-08 | Paper |
| scientific article; zbMATH DE number 1966526 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1929950 (Why is no real title available?) | 2003-06-18 | Paper |
Collage system: A unifying framework for compressed pattern matching.
Theoretical Computer Science | 2003-05-22 | Paper |
Uniform characterizations of polynomial-query learnabilities
Theoretical Computer Science | 2003-05-14 | Paper |
A practical algorithm to find the best subsequence patterns
Theoretical Computer Science | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1786457 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1786459 (Why is no real title available?) | 2002-08-21 | Paper |
| scientific article; zbMATH DE number 1629861 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1615280 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1372670 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322311 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1045405 (Why is no real title available?) | 1997-09-18 | Paper |
| scientific article; zbMATH DE number 996385 (Why is no real title available?) | 1997-04-03 | Paper |
| scientific article; zbMATH DE number 970719 (Why is no real title available?) | 1997-03-19 | Paper |
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
Theoretical Computer Science | 1997-02-28 | Paper |
A machine discovery from amino acid sequences by decision trees over regular patterns
New Generation Computing | 1994-01-31 | Paper |
| scientific article; zbMATH DE number 408771 (Why is no real title available?) | 1993-09-06 | Paper |
Teachability in computational learning
New Generation Computing | 1991-01-01 | Paper |
