| Publication | Date of Publication | Type |
|---|
Technology mapping of multi-output functions leading to the reduction of dynamic power consumption in FPGAs
International Journal of Applied Mathematics and Computer Science | 2023-09-07 | Paper |
A linear-time algorithm for seeds computation
ACM Transactions on Algorithms | 2021-05-03 | Paper |
| A linear time algorithm for seeds computation | 2019-05-10 | Paper |
Text redundancies
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Discrete Applied Mathematics | 2016-04-07 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
A linear time algorithm for consecutive permutation pattern matching
Information Processing Letters | 2014-08-13 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
| scientific article; zbMATH DE number 6146456 (Why is no real title available?) | 2013-03-19 | Paper |
Computing the longest previous factor
European Journal of Combinatorics | 2012-11-15 | Paper |
On the maximum number of cubic subwords in a word
European Journal of Combinatorics | 2012-11-15 | Paper |
The maximal number of cubic runs in a word
Journal of Computer and System Sciences | 2012-11-06 | Paper |
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms | 2012-09-13 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Improved algorithms for the range next value problem and applications
Theoretical Computer Science | 2012-06-25 | Paper |
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Approximation of RNA multiple structural alignment
Journal of Discrete Algorithms | 2012-01-04 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Finding patterns in given intervals
Fundamenta Informaticae | 2011-06-14 | Paper |
On the Maximal Sum of Exponents of Runsin a String
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
On the maximal number of cubic subwords in a string
Lecture Notes in Computer Science | 2009-12-11 | Paper |
LPF computation revisited
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Algorithms for Computing the Longest Parameterized Common Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
RNA multiple structural alignment with longest common subsequences
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
Approximation of RNA Multiple Structural Alignment
Combinatorial Pattern Matching | 2007-09-14 | Paper |
| scientific article; zbMATH DE number 1956491 (Why is no real title available?) | 2003-07-30 | Paper |
