Korshunov Aleksei Dmitrievich

Publications in Math-Net.Ru

1. Computational complexity of Boolean functions
   
   Uspekhi Mat. Nauk, 67:1(403) (2012),  97–168
2. Some unsolved problems in discrete mathematics and mathematical cybernetics
   
   Uspekhi Mat. Nauk, 64:5(389) (2009),  3–20
3. The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions of $n$-variables). III. The case of $k\geq 3$ and arbitrary $n$
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:3 (2005),  60–73
4. The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions of $n$ variables). II. The case of odd $n$ and $k=2$
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005),  12–70
5. The number of $k$-nonseparated families of subsets of an $n$-element set ($k$-nonseparated Boolean functions). I. The case of even $n$ and $k=2$
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 10:4 (2003),  31–69
6. Monotone Boolean functions
   
   Uspekhi Mat. Nauk, 58:5(353) (2003),  89–162
7. For what $k$ in almost every $n$-vertex graph do there exist all nonisomorphic $k$-vertex subgraphs?
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  54–67
8. The number of special monotone Boolean functions and statistical properties of stack filters
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  17–44
9. On the asymptotics of the number of binary words with a given length of a maximal series. I
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  13–46
10. On the number of $(-1,1)$-matrices of order $n$ with a fixed permanent
    
    Diskretn. Anal. Issled. Oper., 3:1 (1996),  23–42
11. Sergei Vsevolodovich Yablonskii (on his 70th birthday)
    
    Sibirsk. Zh. Issled. Oper., 1:4 (1994),  3–6
12. On the complexity of coverings of numerical sets by arithmetic progressions
    
    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  40–60
13. On the number of graphs with a fixed number of vertices, edges, and isolated vertices
    
    Trudy Inst. Mat. SO RAN, 27 (1994),  43–93
14. On linear extensions of partially ordered sets
    
    Trudy Inst. Mat. SO RAN, 27 (1994),  34–42
15. The power and structure of closed Post classes (families of subsets of a finite set)
    
    Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988),  159–204
16. On the power and structure of some closed Post classes (families of subsets of a finite set)
    
    Dokl. Akad. Nauk SSSR, 295:3 (1987),  533–537
17. The main properties of random graphs with a large number of vertices and edges
    
    Uspekhi Mat. Nauk, 40:1(241) (1985),  107–173
18. Solution of Dedekind's problem on the number of monotonic Boolean functions
    
    Dokl. Akad. Nauk SSSR, 233:4 (1977),  543–546
19. Solution of a problem of Erdős and Renyi on Hamiltonian cycles in nonoriented graphs
    
    Dokl. Akad. Nauk SSSR, 228:3 (1976),  529–532
20. The number of automata and boundedly determined functions. Hereditary properties of automata
    
    Dokl. Akad. Nauk SSSR, 221:6 (1975),  1264–1267
21. On the number of pairs of Hamilton cycles in a complete graph having a prescribed number of common edges
    
    Upravliaemie systemy, 1974, no. 13,  40–57
22. On the diameter of graphs
    
    Dokl. Akad. Nauk SSSR, 196:5 (1971),  1013–1015
23. Number of nonisomorphic subgraphs in an $n$-point graph
    
    Mat. Zametki, 9:3 (1971),  263–273
24. The power of certain classes of graphs
    
    Dokl. Akad. Nauk SSSR, 193:6 (1970),  1230–1233
25. An upper estimate of the lengths of the shortest homogeneous experiments in the recognition of the final state for almost all automata
    
    Dokl. Akad. Nauk SSSR, 184:1 (1969),  28–29
26. Number, degree of distinguishability and diameter of permutation automata and of operators realizable by them
    
    Dokl. Akad. Nauk SSSR, 182:2 (1968),  262–265
27. Asymptotic Behavior of the Maximum of the Weight of a Finite Tree
    
    Probl. Peredachi Inf., 2:1 (1966),  96–99


28. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., 15:2 (2008),  100–101
29. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:4 (2007),  103–105
30. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  102–103
31. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006),  100–101
32. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005),  95–97
33. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005),  100–102
34. Yurii Ivanovich Zhuravlev (on his 70th birthday)
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005),  3–11
35. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  99–100
36. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  91
37. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:4 (2003),  103–104
38. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  108–110
39. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002),  102–104
40. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  114–116
41. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001),  92–93
42. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  129–131
43. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  99–100
44. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  123–124
45. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:2 (1999),  97–98
46. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998),  97–99
47. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998),  97–98
48. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  112–114
49. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997),  112–114
50. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., 3:4 (1996),  93–94
51. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., 3:2 (1996),  90–91
52. New books for discrete mathematics
    
    Diskretn. Anal. Issled. Oper., 2:4 (1995),  97–99
53. School-seminar “Synthesis and Complexity of Controlled Systems”
    
    Diskretn. Anal. Issled. Oper., 2:1 (1995),  98–81
54. New books for discrete mathematics
    
    Sibirsk. Zh. Issled. Oper., 1:4 (1994),  93–95
55. New books for discrete mathematics
    
    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  100–102
56. Sixth school-seminar “Synthesis and Complexity of Controlled Systems”
    
    Sibirsk. Zh. Issled. Oper., 1:1 (1994),  75–84