Bulitko Valerii Konstantinovich

Publications in Math-Net.Ru

1. $m$-Reducibility with Upper and Lower Bounds for the Reducing Functions
   
   Mat. Zametki, 70:1 (2001),  12–21
2. Recursively compressible sets
   
   Mat. Zametki, 64:1 (1998),  9–16
3. Sub-Turing reducibilities of bounded complexity
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1992, no. 1,  27–37
4. On ways of characterizing complete sets
   
   Izv. Akad. Nauk SSSR Ser. Mat., 55:2 (1991),  227–253
5. On $1/n$-hereditary sets
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 6,  3–11
6. Boolean classes of Turing reductions
   
   Izv. Akad. Nauk SSSR Ser. Mat., 49:1 (1985),  3–31
7. Reducibility via Zhegalkin's linear tables
   
   Sibirsk. Mat. Zh., 21:3 (1980),  23–31
8. On Computations with Limited Storage of Entries
   
   Probl. Peredachi Inf., 14:4 (1978),  105–108
9. Об одной алгоритмически неразрешимой массовой задаче для графов
   
   Upravliaemie systemy, 1973, no. 11,  61–73
10. Graphs with prescribed environments of the vertices
    
    Trudy Mat. Inst. Steklov., 133 (1973),  78–94


11. Letter to the editor
    
    Izv. RAN. Ser. Mat., 56:4 (1992),  907