| Publication | Date of Publication | Type |
|---|
| Quantum string matching unfolded and extended | 2024-01-11 | Paper |
| Compact suffix automata representations for searching long patterns | 2023-04-20 | Paper |
| Sequence searching allowing for non-overlapping adjacent unbalanced translocations | 2023-02-07 | Paper |
| Improved characters distance sampling for online and offline text searching | 2023-02-01 | Paper |
| A weak approach to suffix automata simulation for exact and approximate string matching | 2022-09-27 | Paper |
| The Range Automaton: an efficient approach to text-searching | 2022-05-20 | Paper |
| Efficient string matching based on a two-step simulation of the suffix automaton | 2022-03-22 | Paper |
| Fast algorithms for single and multiple pattern Cartesian tree matching | 2020-12-15 | Paper |
| Efficient online string matching based on characters distance text sampling | 2020-10-21 | Paper |
| Fast multiple pattern Cartesian tree matching | 2020-07-22 | Paper |
| The order-preserving pattern matching problem in practice | 2020-02-14 | Paper |
| Fast Packed String Matching for Short Patterns | 2019-09-12 | Paper |
| Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition | 2019-03-27 | Paper |
| Verifiable pattern matching on outsourced texts | 2019-01-04 | Paper |
| A Very Fast String Matching Algorithm Based on Condensed Alphabets | 2016-11-09 | Paper |
| Efficient Algorithms for the Order Preserving Pattern Matching Problem | 2016-11-09 | Paper |
| Verifiable Pattern Matching on Outsourced Texts | 2016-10-21 | Paper |
| Text searching allowing for inversions and translocations of factors | 2015-09-22 | Paper |
| Fast and flexible packed string matching | 2014-09-05 | Paper |
| Improved and self-tuned occurrence heuristics | 2014-09-05 | Paper |
| Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs | 2014-08-13 | Paper |
| The exact online string matching problem | 2014-08-13 | Paper |
| Efficient string-matching allowing for non-overlapping inversions | 2014-01-09 | Paper |
| String matching with inversions and translocations in linear average time (most of the time) | 2013-03-28 | Paper |
| A Fast Suffix Automata Based Algorithm for Exact Online String Matching | 2012-09-20 | Paper |
| PATTERN MATCHING WITH SWAPS IN PRACTICE | 2012-08-30 | Paper |
| ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS | 2012-08-30 | Paper |
| A compact representation of nondeterministic (suffix) automata for the bit-parallel approach | 2012-05-24 | Paper |
| On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns | 2012-05-11 | Paper |
| Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions | 2011-06-29 | Paper |
| A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach | 2010-07-26 | Paper |
| EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM | 2010-01-08 | Paper |
| NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL | 2010-01-08 | Paper |
| A New Algorithm for Efficient Pattern Matching with Swaps | 2009-12-11 | Paper |
| Pattern Matching for Control Chart Monitoring | 2009-03-31 | Paper |
| Pattern Matching with Swaps for Short Patterns in Linear Time | 2009-02-03 | Paper |
| ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES | 2008-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446121 | 2008-03-06 | Paper |
| Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm | 2007-05-29 | Paper |
| A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM | 2007-02-08 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426344 | 2003-09-16 | Paper |
