| Publication | Date of Publication | Type |
|---|
A lower bound on complexity of a locator cellular automaton solution for the closest neighbor search problem
Moscow University Mathematics Bulletin | 2024-02-16 | Paper |
Forming of multi-colour images by cellular automata
Moscow University Mathematics Bulletin | 2020-08-12 | Paper |
On stabilization of an automaton model of migration processes
Discrete Mathematics and Applications | 2020-07-30 | Paper |
The algorithm for identical object searching with bounded worst-case complexity and linear memory
Discrete Mathematics and Applications | 2016-11-17 | Paper |
Information storage and search complexity theory
Journal of Mathematical Sciences (New York) | 2014-06-06 | Paper |
| Theory of test recognition | 2008-06-12 | Paper |
On automaton determinisation of sets of superwords
Discrete Mathematics and Applications | 2007-11-02 | Paper |
| A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem | 2006-11-20 | Paper |
On the functional complexity of a two-dimensional interval search problem
Discrete Mathematics and Applications | 2004-08-30 | Paper |
Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
Doklady Mathematics | 2004-06-15 | Paper |
| scientific article; zbMATH DE number 2032365 (Why is no real title available?) | 2004-01-26 | Paper |
| scientific article; zbMATH DE number 1988012 (Why is no real title available?) | 2003-10-05 | Paper |
| scientific article; zbMATH DE number 1889083 (Why is no real title available?) | 2003-03-27 | Paper |
A lower bound for the complexity of inclusive search in the class of tree circuits
Discrete Mathematics and Applications | 2001-11-22 | Paper |
Estimates of the complexity of a method to solve the problem of inclusive search
Discrete Mathematics and Applications | 2001-05-10 | Paper |
Modelling and search complexity in multiprocessor Systems
Discrete Mathematics and Applications | 2001-05-10 | Paper |
A constant, in the worst case, algorithm to search for identical objects
Discrete Mathematics and Applications | 2001-01-04 | Paper |
| scientific article; zbMATH DE number 1320677 (Why is no real title available?) | 1999-10-05 | Paper |
| scientific article; zbMATH DE number 999544 (Why is no real title available?) | 1997-04-15 | Paper |
A lower bound for the complexity of information networks for one partial order relation
Discrete Mathematics and Applications | 1997-03-23 | Paper |
Instantly solvable search problems
Discrete Mathematics and Applications | 1997-03-23 | Paper |
On a one-dimensional interval search problem
Discrete Mathematics and Applications | 1996-01-28 | Paper |
| scientific article; zbMATH DE number 647637 (Why is no real title available?) | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 20618 (Why is no real title available?) | 1992-06-26 | Paper |
The complexity of a search in an array of Boolean vectors
Moscow University Computational Mathematics and Cybernetics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4045170 (Why is no real title available?) | 1987-01-01 | Paper |
