| Publication | Date of Publication | Type |
|---|
| Quantum path parallelism: a circuit-based approach to text searching | 2024-11-12 | Paper |
| Fast Cartesian tree matching | 2024-04-19 | Paper |
Quantum string matching unfolded and extended
Reversible Computation | 2024-01-11 | Paper |
Compact suffix automata representations for searching long patterns
Theoretical Computer Science | 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
Theoretical Computer Science | 2023-02-01 | Paper |
A weak approach to suffix automata simulation for exact and approximate string matching
Theoretical Computer Science | 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
Theoretical Computer Science | 2020-12-15 | Paper |
Efficient online string matching based on characters distance text sampling
Algorithmica | 2020-10-21 | Paper |
Fast multiple pattern Cartesian tree matching
(available as arXiv preprint) | 2020-07-22 | Paper |
The order-preserving pattern matching problem in practice
Discrete Applied Mathematics | 2020-02-14 | Paper |
Fast Packed String Matching for Short Patterns
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Linear and efficient string matching algorithms based on weak factor recognition
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Verifiable pattern matching on outsourced texts
Journal of Discrete Algorithms | 2019-01-04 | Paper |
Efficient algorithms for the order preserving pattern matching problem
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
A very fast string matching algorithm based on condensed alphabets
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Verifiable pattern matching on outsourced texts
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Text searching allowing for inversions and translocations of factors
Discrete Applied Mathematics | 2015-09-22 | Paper |
Fast and flexible packed string matching
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Improved and self-tuned occurrence heuristics
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms | 2014-08-13 | Paper |
The exact online string matching problem: a review of the most recent results
ACM Computing Surveys | 2014-08-13 | Paper |
Efficient string-matching allowing for non-overlapping inversions
Theoretical Computer Science | 2014-01-09 | Paper |
String matching with inversions and translocations in linear average time (most of the time)
Information Processing Letters | 2013-03-28 | Paper |
A fast suffix automata based algorithm for exact online string matching
Implementation and Application of Automata | 2012-09-20 | Paper |
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Pattern matching with swaps in practice
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information and Computation | 2012-05-24 | Paper |
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Efficient matching of biological sequences allowing for non-overlapping inversions
Combinatorial Pattern Matching | 2011-06-29 | Paper |
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Efficient variants of the backward-oracle-matching algorithm
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
New efficient bit-parallel algorithms for the \((\delta , \alpha )\)-matching problem with applications in music information retrieval
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
A new algorithm for efficient pattern matching with swaps
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Pattern Matching for Control Chart Monitoring
Progress in Industrial Mathematics at ECMI 2006 | 2009-03-31 | Paper |
Pattern Matching with Swaps for Short Patterns in Linear Time
Lecture Notes in Computer Science | 2009-02-03 | Paper |
ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
| Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm | 2008-03-06 | Paper |
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 1982175 (Why is no real title available?) | 2003-09-16 | Paper |
