| Publication | Date of Publication | Type |
|---|
| Optimal strategy for solving a special case of the knapsack problem by the branch and bound method | 2021-11-23 | Paper |
| A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees | 2021-09-14 | Paper |
| The scalability analysis of a parallel tree search algorithm | 2021-05-18 | Paper |
| The scalability analysis of a parallel tree search algorithm | 2021-02-17 | Paper |
| Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method | 2021-01-08 | Paper |
| On realizing shapes in the theory of RNA neutral networks | 2020-07-09 | Paper |
| Some results on the number of periodic factors in words | 2020-01-17 | Paper |
| Optimal bounds for computing \({\alpha}\)-gapped repeats | 2019-09-17 | Paper |
| Indexing and querying character sets in one- and two-dimensional words | 2018-10-11 | Paper |
| On the best choice of a branching variable in the subset sum problem | 2018-04-23 | Paper |
| On the number of gapped repeats with arbitrary gap | 2018-04-04 | Paper |
| Searching of gapped repeats and subrepetitions in a word | 2017-11-09 | Paper |
| Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering | 2017-08-23 | Paper |
| Indexing and querying color sets of images | 2016-09-01 | Paper |
| Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats | 2016-04-13 | Paper |
| Various improvements to text fingerprinting | 2014-08-13 | Paper |
| Searching of Gapped Repeats and Subrepetitions in a Word | 2014-06-30 | Paper |
| Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem | 2013-07-16 | Paper |
| On primary and secondary repetitions in words | 2012-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115678 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115592 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115630 | 2012-02-10 | Paper |
| On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters | 2011-12-07 | Paper |
| On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method | 2011-01-03 | Paper |
| On maximal repetitions of arbitrary exponent | 2010-09-07 | Paper |
| Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem | 2010-09-06 | Paper |
| Searching for gapped palindromes | 2009-11-18 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2009-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3617442 | 2009-03-24 | Paper |
| New algorithms for text fingerprinting | 2008-08-08 | Paper |
| Searching for Gapped Palindromes | 2008-06-17 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| New Algorithms for Text Fingerprinting | 2007-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428618 | 2007-03-28 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2006-10-20 | Paper |
| On multivalued transformations of finite sets of binary distributions with rational probabilities | 2006-10-10 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Space efficient search for maximal repetitions | 2005-06-30 | Paper |
| Linear-time computation of local periods | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453462 | 2004-03-07 | Paper |
| Finding approximate repetitions under Hamming distance. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796175 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934345 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699311 | 1999-11-10 | Paper |
| Criterion of generativeness of sets of rational probabilities by a class of Boolean functions | 1999-10-28 | Paper |
| On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets | 1999-07-11 | Paper |
| On repetition-free binary words of minimal density | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218146 | 1999-03-02 | Paper |
| Generation of rational numbers by probabilistic contact π-networks | 1995-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327613 | 1995-04-09 | Paper |
| On the generation of rational numbers by probabilistic contact nets | 1993-06-29 | Paper |
| On the bounds for the complexity of generation of rational numbers by stochastic contact \(\pi{}\)-networks | 1993-06-29 | Paper |
| On generation of some classes of rational numbers by probabilistic \(\pi\)- nets | 1992-06-25 | Paper |
| On complexity estimates for the generation of rational numbers by probabilistic contact \(\pi\)-nets | 1992-01-01 | Paper |
| On the generation of rational numbers by probabilistic contact nets | 1992-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3349660 | 1991-01-01 | Paper |
