Alekseev Valerii Borisovich

Publications in Math-Net.Ru

1. On the cardinality of interval Int(Pol$_k$) in partial $k$-valued logic
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3,  11–17
2. On closed classes in partial $k$-valued logic that contain all polynomials
   
   Diskr. Mat., 33:2 (2021),  6–19
3. On closed classes in partial $k$-valued logic that contain the class of monotone functions
   
   Diskr. Mat., 30:2 (2018),  3–13
4. On some results in algebraic complexity theory
   
   Intelligent systems. Theory and applications, 21:3 (2017),  5–22
5. On bilinear complexity of multiplication of $m\times 2$ and $2\times 2$ matrices
   
   Chebyshevskii Sb., 16:4 (2015),  11–27
6. On bilinear complexity of multiplication of $5\times2$ matrix by $2\times2$ matrix
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  19–29
7. On the Exact and Approximate Bilinear Complexities of Multiplication of $4\times2$ and $2\times2$ Matrices
   
   Sovrem. Probl. Mat., 17 (2013),  135–152
8. On Some Closed Classes of Self-dual Partial Many-valued Functions
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  16–24
9. Complexity of multiplication in some group algebras
   
   Diskr. Mat., 17:1 (2005),  3–17
10. On the number closure-type mappings
    
    Diskr. Mat., 16:2 (2004),  85–97
11. Minimal extensions with simple multiplication for an algebra of second-order matrices
    
    Diskr. Mat., 9:1 (1997),  71–82
12. From the Karatsuba method for fast multiplication on numbers to fast algorithms for discrete functions
    
    Trudy Mat. Inst. Steklova, 218 (1997),  20–27
13. On the complexity of the recognition of the completeness of systems of functions in the class $P_3^*$
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 3,  6–9
14. Logical semirings and their use in constructing fast algorithms
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 1,  22–29
15. On some algebras associated with fast algorithms
    
    Diskr. Mat., 8:1 (1996),  52–64
16. On some closed classes in partial two-valued logic
    
    Diskr. Mat., 6:4 (1994),  58–79
17. Embeddings of graphs in a surface and the theory of flow graphs
    
    Diskr. Mat., 2:4 (1990),  97–115
18. The number of families of subsets that are closed with respect to intersections
    
    Diskr. Mat., 1:2 (1989),  129–136
19. The number of functions in some closed classes of a partial $k$-valued logic
    
    Diskr. Mat., 1:1 (1989),  32–42
20. Stepwise bilinear algorithms and recognition of completeness in $k$-valued logics
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  19–27
21. A method of constructing fast algorithms in the $k$-valued logic
    
    Mat. Zametki, 38:1 (1985),  148–156
22. Number of functions in classes given by central predicates
    
    Mat. Zametki, 37:6 (1985),  880–886
23. Semisimple bases of $k$-valued logic
    
    Mat. Zametki, 28:3 (1980),  407–422
24. The thickness of an arbitrary complete graph
    
    Mat. Sb. (N.S.), 101(143):2(10) (1976),  212–230
25. The decipherment of certain classes of monotone multivalued functions
    
    Zh. Vychisl. Mat. Mat. Fiz., 16:1 (1976),  189–198
26. On the number of $k$-valued monotonic functions
    
    Dokl. Akad. Nauk SSSR, 208:3 (1973),  505–508
27. On simple bases of $k$-valued logic
    
    Mat. Zametki, 5:4 (1969),  471–482


28. Валентин Федорович Колчин (1934–2016)
    
    Diskr. Mat., 28:4 (2016),  3–5
29. The XVII International Conference “Problems of Theoretical Cybernetics”
    
    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  5–6
30. Yurii Vasil'evich Prokhorov (on the occasion of his eightieth birthday)
    
    Diskr. Mat., 22:1 (2010),  3–4
31. The XV International Conference “Problems of Theoretical Cybernetics”
    
    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  5–6
32. Точка вне окружности
    
    Kvant, 2006, no. 3,  43–46
33. Sergei Vsevolodovich Yablonskii (1924–1998)
    
    Diskr. Mat., 11:1 (1999),  151–157