Chashkin Aleksandr Viktorovich

Publications in Math-Net.Ru

1. Linear hashing in the Boolean cube with clusters of limited size
   
   Diskr. Mat., 36:2 (2024),  124–131
2. On the implementation of monotone Boolean functions by memoryless programs
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3,  25–32
3. Aleksandr Borisovich Ugol'nikov (04.12.1951–19.07.2013)
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6,  58–62
4. On the average-case complexity of Boolean functions under binomial distribution on their domains
   
   Diskr. Mat., 32:3 (2020),  130–134
5. On the average-case complexity of underdetermined functions
   
   Diskr. Mat., 29:2 (2017),  133–159
6. Incomparable integrals and approximate calculation of monotone Boolean functions
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 5,  51–55
7. Mean computing time of Boolean operators by programs with restricted memory
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 3,  16–21
8. Bounds for the average-case complexity of monotone Boolean functions
   
   Diskr. Mat., 28:2 (2016),  146–153
9. On linear operators injective on arbitrary subsets
   
   Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  132–141
10. Modeling nonbranching programs with conditional stopping on a universal Turing machine
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007),  94–109
11. Realization of graphs in a subspace of bounded height
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 3,  36–40
12. On the complexity of a cyclic shift of a set of real numbers
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  89–92
13. On the complexity of realization of Boolean functions by formulas
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005),  56–72
14. On the average monotone complexity of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  68–80
15. Modeling circuits consisting of functional elements on a universal Turing machine
    
    Diskr. Mat., 16:2 (2004),  98–103
16. On the Reconstruction of a Boolean Function from Its Values on a Limited Number of Domains
    
    Trudy Mat. Inst. Steklova, 242 (2003),  108–122
17. Average complexity of symmetric Boolean functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2003, no. 1,  16–19
18. On the randomized complexity of functions that approximate a voting function
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  77–93
19. $(s,d,\varepsilon)$-decomposition of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  94–101
20. On the mean time for computing the values of elementary Boolean functions
    
    Diskr. Mat., 12:4 (2000),  109–120
21. On a decomposition of Boolean functions
    
    Diskr. Mat., 12:3 (2000),  114–123
22. Modeling of circuits consisting of functional elements by Turing machines
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999),  42–70
23. On the complexity of narrow systems of Boolean functions
    
    Diskr. Mat., 11:3 (1999),  149–159
24. On the realization of linear Boolean operators by nonbranching programs with a conditional stop
    
    Diskr. Mat., 11:1 (1999),  146–150
25. Self-correcting schemes that realize “narrow” systems of linear Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998),  80–95
26. On the mean time for computing Boolean operators
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:1 (1998),  88–103
27. Lower bounds for the complexity of systems of vectors of $k$-valued logic
    
    Diskr. Mat., 10:1 (1998),  46–62
28. On the mean time of the computation of polynomially reducible Boolean functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1998, no. 1,  68–71
29. Local complexity of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:3 (1997),  69–80
30. On the computation of Boolean functions by probabilistic programs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:3 (1997),  49–68
31. Lower bounds on complexity of restrictions of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997),  75–111
32. On the average time for the computation of the values of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  60–78
33. On domains completely specifying Boolean functions
    
    Diskr. Mat., 9:4 (1997),  21–23
34. On the complexity and depth of circuits realizing partial Boolean functions
    
    Diskr. Mat., 9:2 (1997),  53–58
35. Self-correcting schemes for functions of polynomial weight
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 5,  64–66
36. On estimates for the complexity of restrictions of Boolean functions
    
    Dokl. Akad. Nauk, 348:5 (1996),  595–597
37. On the complexity of restrictions of Boolean functions
    
    Diskr. Mat., 8:2 (1996),  133–150
38. On the complexity of finite graphs
    
    Dokl. Akad. Nauk, 340:6 (1995),  748–750
39. On the Shannon function for the generation of Boolean matrices
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 5,  10–18
40. On the effect of negations on the complexity of the realization of partial monotone Boolean functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 3,  44–47
41. On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
    
    Diskr. Mat., 6:2 (1994),  43–73


42. 90 years since the birthday of Academician Oleg Borisovich Lupanov (02.06.1932 – 03.05.2006)
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3,  3–5
43. Oktay Muradoviсh Kasim-Zade (29.04.1953–22.12.2020)
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 4,  60–63