Roman M. Kolpakov

From MaRDI portal
Person:828196

Available identifiers

zbMath Open kolpakov.roman-mMaRDI QIDQ828196

List of research outcomes

PublicationDate of PublicationType
Optimal strategy for solving a special case of the knapsack problem by the branch and bound method2021-11-23Paper
A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees2021-09-14Paper
The scalability analysis of a parallel tree search algorithm2021-05-18Paper
The scalability analysis of a parallel tree search algorithm2021-02-17Paper
Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method2021-01-08Paper
On realizing shapes in the theory of RNA neutral networks2020-07-09Paper
Some results on the number of periodic factors in words2020-01-17Paper
Optimal bounds for computing \({\alpha}\)-gapped repeats2019-09-17Paper
Indexing and querying character sets in one- and two-dimensional words2018-10-11Paper
On the best choice of a branching variable in the subset sum problem2018-04-23Paper
On the number of gapped repeats with arbitrary gap2018-04-04Paper
Searching of gapped repeats and subrepetitions in a word2017-11-09Paper
Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering2017-08-23Paper
Indexing and querying color sets of images2016-09-01Paper
Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats2016-04-13Paper
Various improvements to text fingerprinting2014-08-13Paper
Searching of Gapped Repeats and Subrepetitions in a Word2014-06-30Paper
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem2013-07-16Paper
On primary and secondary repetitions in words2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31155922012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156302012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156782012-02-10Paper
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters2011-12-07Paper
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method2011-01-03Paper
On maximal repetitions of arbitrary exponent2010-09-07Paper
Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem2010-09-06Paper
Searching for gapped palindromes2009-11-18Paper
Stochastic Algorithms: Foundations and Applications2009-05-26Paper
https://portal.mardi4nfdi.de/entity/Q36174422009-03-24Paper
New algorithms for text fingerprinting2008-08-08Paper
Searching for Gapped Palindromes2008-06-17Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
New Algorithms for Text Fingerprinting2007-09-14Paper
https://portal.mardi4nfdi.de/entity/Q34286182007-03-28Paper
Stochastic Algorithms: Foundations and Applications2006-10-20Paper
On multivalued transformations of finite sets of binary distributions with rational probabilities2006-10-10Paper
Combinatorial Pattern Matching2005-09-07Paper
Space efficient search for maximal repetitions2005-06-30Paper
Linear-time computation of local periods2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44534622004-03-07Paper
Finding approximate repetitions under Hamming distance.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47961752003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q49343452000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q46993111999-11-10Paper
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions1999-10-28Paper
On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets1999-07-11Paper
On repetition-free binary words of minimal density1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42181461999-03-02Paper
Generation of rational numbers by probabilistic contact π-networks1995-05-22Paper
https://portal.mardi4nfdi.de/entity/Q43276131995-04-09Paper
On the generation of rational numbers by probabilistic contact nets1993-06-29Paper
On the bounds for the complexity of generation of rational numbers by stochastic contact \(\pi{}\)-networks1993-06-29Paper
On generation of some classes of rational numbers by probabilistic \(\pi\)- nets1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33626921992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33626931992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33496601991-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Roman M. Kolpakov