|
|
Publications in Math-Net.Ru
-
Hypergraph edge representations with the use of homological paths
Diskretn. Anal. Issled. Oper., 30:3 (2023), 81–95
-
Testing the satisfiability of algebraic formulas over the field of two elements
Probl. Peredachi Inf., 59:1 (2023), 64–70
-
A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
Diskretn. Anal. Issled. Oper., 28:4 (2021), 117–124
-
Counting the number of perfect matchings, and generalized decision trees
Probl. Peredachi Inf., 57:2 (2021), 51–70
-
Geometry of translations on a Boolean cube
Probl. Peredachi Inf., 55:2 (2019), 58–81
-
Fast protocols for leader election and spanning tree construction in a distributed network
Probl. Peredachi Inf., 53:2 (2017), 91–111
-
On the linear classification of even and odd permutation matrices and the complexity of computing the permanent
Zh. Vychisl. Mat. Mat. Fiz., 57:2 (2017), 362–372
-
Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions
Diskr. Mat., 28:4 (2016), 50–57
-
On regular realizability problems for context-free languages
Probl. Peredachi Inf., 51:4 (2015), 47–59
-
Distributed communication complexity of spanning tree construction
Probl. Peredachi Inf., 51:1 (2015), 54–71
-
Separation of words by positions of subwords
Diskretn. Anal. Issled. Oper., 21:1 (2014), 3–14
-
On expressive power of regular realizability problems
Probl. Peredachi Inf., 49:3 (2013), 86–104
-
Cones of multipowers and combinatorial optimization problems
Zh. Vychisl. Mat. Mat. Fiz., 53:5 (2013), 816–824
-
Decidability conditions for problems about automata reading infinite words
Diskretn. Anal. Issled. Oper., 19:2 (2012), 3–18
-
Ультраметрики, деревья, потоки и узкие места
Mat. Pros., Ser. 3, 16 (2012), 75–88
-
On regular realizability problems
Probl. Peredachi Inf., 47:4 (2011), 43–54
-
Orbits of linear maps and regular languages properties
Diskretn. Anal. Issled. Oper., 17:6 (2010), 20–49
-
О представлении чисел в виде суммы двух квадратов
Mat. Pros., Ser. 3, 10 (2006), 190–194
-
Пфаффианы или искусство расставлять знаки…
Mat. Pros., Ser. 3, 9 (2005), 129–142
-
Approximate computation of the weight function of a linear binary code
Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004), 3–19
-
Monotone Boolean polynomials
Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002), 41–49
-
Сложность вычислительных задач
Mat. Pros., Ser. 3, 4 (2000), 81–114
-
On the stability of the Voronoĭ diagram
Zh. Vychisl. Mat. Mat. Fiz., 36:3 (1996), 147–158
-
One-dimensional projections of polyhedra of problems of discrete optimization
Diskr. Mat., 3:3 (1991), 35–45
-
Фуксовы группы: от топологии к геометрии
Mat. Pros., Ser. 3, 13 (2009), 33–49
-
Vladimir M. Tikhomirov
Mosc. Math. J., 5:1 (2005), 295
-
Кратчайшие пути по поверхности параллелепипеда
Mat. Pros., Ser. 3, 9 (2005), 203–206
-
Задача Герко о чемпионах
Mat. Pros., Ser. 3, 4 (2000), 209–210
© , 2024