Markov Aleksandr Aleksandrovich

Publications in Math-Net.Ru

1. Calculation of Boolean functions by systems of formulas of bounded complexity
   
   Diskr. Mat., 4:4 (1992),  12–25
2. Scheme complexity of discrete optimization
   
   Diskr. Mat., 4:3 (1992),  29–46
3. Vector optimization of decompositions of root trees
   
   Diskr. Mat., 3:2 (1991),  58–68
4. On dictionary colorings and some perfect graphs
   
   Diskr. Mat., 2:2 (1990),  16–32
5. Systems of equations of the antiprefix property in words
   
   Diskr. Mat., 2:2 (1990),  3–15
6. Vector optimization of decompositions of root trees
   
   Diskr. Mat., 1:2 (1989),  3–14
7. Algorithmic foundations of generalized-prefix encodings
   
   Dokl. Akad. Nauk SSSR, 274:4 (1984),  790–793
8. On the dependence of the efficiency of alphabet coding on the language of communications
   
   Dokl. Akad. Nauk SSSR, 258:2 (1981),  304–307
9. On $F$-semigroups with three generators
   
   Mat. Zametki, 14:2 (1973),  267–277
10. Combinatorial lemma and structure of a class of binary codes
    
    Mat. Zametki, 7:3 (1970),  325–331
11. Some Properties of Infinite Prefix Codes
    
    Probl. Peredachi Inf., 6:1 (1970),  97–98
12. Example of an independent system of words which cannot be included in a finite complete system
    
    Mat. Zametki, 1:1 (1967),  87–90
13. Alphabetic coding
    
    Dokl. Akad. Nauk SSSR, 139:3 (1961),  560–561
14. Alphabet coding
    
    Dokl. Akad. Nauk SSSR, 132:3 (1960),  521–523