2024
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm.
Concurr. Comput. Pract. Exp., August, 2024
2022
Almost optimal searching of maximal subrepetitions in a word.
CoRR, 2022
2021
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem.
Open Comput. Sci., 2021
2020
The scalability analysis of a parallel tree search algorithm.
Optim. Lett., 2020
Some results on the number of periodic factors in words.
Inf. Comput., 2020
2019
Optimal bounds for computing <i>α</i>-gapped repeats.
Inf. Comput., 2019
2018
On the number of gapped repeats with arbitrary gap.
Theor. Comput. Sci., 2018
2017
Searching of gapped repeats and subrepetitions in a word.
J. Discrete Algorithms, 2017
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering.
Autom. Remote. Control., 2017
2016
Indexing and querying color sets of images.
Theor. Comput. Sci., 2016
Optimal Bounds for Computing \alpha α -gapped Repeats.
Proceedings of the Language and Automata Theory and Applications, 2016
2015
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method.
CoRR, 2015
Optimal searching of gapped repeats in a word.
CoRR, 2015
2013
Various improvements to text fingerprinting.
J. Discrete Algorithms, 2013
2012
On primary and secondary repetitions in words.
Theor. Comput. Sci., 2012
2011
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters.
Theor. Comput. Sci., 2011
Linear pattern matching on sparse suffix trees
CoRR, 2011
Pattern Matching on Sparse Suffix Trees.
Proceedings of the First International Conference on Data Compression, 2011
2010
On maximal repetitions of arbitrary exponent.
Inf. Process. Lett., 2010
2009
Searching for gapped palindromes.
Theor. Comput. Sci., 2009
2008
New algorithms for text fingerprinting.
J. Discrete Algorithms, 2008
Faster Text Fingerprinting.
Proceedings of the String Processing and Information Retrieval, 2008
2005
Space efficient search for maximal repetitions.
Theor. Comput. Sci., 2005
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005
Real-Time Traversal in Grammar-Based Compressed Files.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005
2004
Linear-time computation of local periods.
Theor. Comput. Sci., 2004
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions.
Discret. Appl. Math., 2004
Real-Time String Matching in Sublinear Space.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004
2003
Finding approximate repetitions under Hamming distance.
Theor. Comput. Sci., 2003
mreps: efficient and flexible detection of tandem repeats in DNA.
Nucleic Acids Res., 2003
Classes of Binary Rational Distributions Closed under Discrete Transformations.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003
2000
Finding Repeats with Fixed Gap.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000
1999
On Repetition-Free Binary Words of Minimal Density.
Theor. Comput. Sci., 1999
Finding Maximal Repetitions in a Word in Linear Time.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
On Maximal Repetitions in Words.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
1997
Minimal Letter Frequency in n-th Power-Free Binary Words.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
1995
On the Complexity of Generation of Rational Numbers by Boolean Functions.
Fundam. Informaticae, 1995