Vyalyi Mikhail Nikolaevich

Publications in Math-Net.Ru

1. Regular realizability problems for descriptions of finite relations
   
   Probl. Peredachi Inf., 60:3 (2024),  46–58
2. Hypergraph edge representations with the use of homological paths
   
   Diskretn. Anal. Issled. Oper., 30:3 (2023),  81–95
3. Testing the satisfiability of algebraic formulas over the field of two elements
   
   Probl. Peredachi Inf., 59:1 (2023),  64–70
4. A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
   
   Diskretn. Anal. Issled. Oper., 28:4 (2021),  117–124
5. Counting the number of perfect matchings, and generalized decision trees
   
   Probl. Peredachi Inf., 57:2 (2021),  51–70
6. Geometry of translations on a Boolean cube
   
   Probl. Peredachi Inf., 55:2 (2019),  58–81
7. Fast protocols for leader election and spanning tree construction in a distributed network
   
   Probl. Peredachi Inf., 53:2 (2017),  91–111
8. 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
9. 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
10. On regular realizability problems for context-free languages
    
    Probl. Peredachi Inf., 51:4 (2015),  47–59
11. Distributed communication complexity of spanning tree construction
    
    Probl. Peredachi Inf., 51:1 (2015),  54–71
12. Separation of words by positions of subwords
    
    Diskretn. Anal. Issled. Oper., 21:1 (2014),  3–14
13. On expressive power of regular realizability problems
    
    Probl. Peredachi Inf., 49:3 (2013),  86–104
14. Cones of multipowers and combinatorial optimization problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 53:5 (2013),  816–824
15. Decidability conditions for problems about automata reading infinite words
    
    Diskretn. Anal. Issled. Oper., 19:2 (2012),  3–18
16. Ультраметрики, деревья, потоки и узкие места
    
    Mat. Pros., Ser. 3, 16 (2012),  75–88
17. On regular realizability problems
    
    Probl. Peredachi Inf., 47:4 (2011),  43–54
18. Orbits of linear maps and regular languages properties
    
    Diskretn. Anal. Issled. Oper., 17:6 (2010),  20–49
19. О представлении чисел в виде суммы двух квадратов
    
    Mat. Pros., Ser. 3, 10 (2006),  190–194
20. Пфаффианы или искусство расставлять знаки…
    
    Mat. Pros., Ser. 3, 9 (2005),  129–142
21. Approximate computation of the weight function of a linear binary code
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  3–19
22. Monotone Boolean polynomials
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  41–49
23. Сложность вычислительных задач
    
    Mat. Pros., Ser. 3, 4 (2000),  81–114
24. On the stability of the Voronoĭ diagram
    
    Zh. Vychisl. Mat. Mat. Fiz., 36:3 (1996),  147–158
25. One-dimensional projections of polyhedra of problems of discrete optimization
    
    Diskr. Mat., 3:3 (1991),  35–45


26. Фуксовы группы: от топологии к геометрии
    
    Mat. Pros., Ser. 3, 13 (2009),  33–49
27. Vladimir M. Tikhomirov
    
    Mosc. Math. J., 5:1 (2005),  295
28. Кратчайшие пути по поверхности параллелепипеда
    
    Mat. Pros., Ser. 3, 9 (2005),  203–206
29. Задача Герко о чемпионах
    
    Mat. Pros., Ser. 3, 4 (2000),  209–210