The following pages link to Roman M. Kolpakov (Q828196):
Displaying 50 items.
- (Q306717) (redirect page) (← links)
- (Q1791758) (redirect page) (← links)
- Indexing and querying color sets of images (Q306719) (← links)
- (Q353697) (redirect page) (← links)
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- On realizing shapes in the theory of RNA neutral networks (Q776594) (← links)
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- New algorithms for text fingerprinting (Q935841) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets (Q1279430) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
- Indexing and querying character sets in one- and two-dimensional words (Q1791759) (← links)
- On the generation of rational numbers by probabilistic contact nets (Q1803044) (← links)
- On the bounds for the complexity of generation of rational numbers by stochastic contact \(\pi{}\)-networks (Q1803083) (← links)
- On generation of some classes of rational numbers by probabilistic \(\pi\)- nets (Q1814322) (← links)
- A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees (Q1982929) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (Q2399471) (← links)
- Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (Q2666932) (← links)
- Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats (Q2798724) (← links)
- (Q3115592) (← links)
- (Q3115630) (← links)
- (Q3115678) (← links)
- (Q3349660) (← links)
- (Q3362692) (← links)
- (Q3362693) (← links)
- (Q3428618) (← links)
- Searching for Gapped Palindromes (Q3506939) (← links)
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem (Q3586262) (← links)
- (Q3617442) (← links)
- Generation of rational numbers by probabilistic contact π-networks (Q3835742) (← links)
- (Q4218146) (← links)
- Criterion of generativeness of sets of rational probabilities by a class of Boolean functions (Q4268145) (← links)
- (Q4327613) (← links)
- (Q4453462) (← links)
- (Q4699311) (← links)
- (Q4796175) (← links)
- (Q4934345) (← links)
- Searching of Gapped Repeats and Subrepetitions in a Word (Q5165607) (← links)
