|
|
|
Publications in Math-Net.Ru |
Citations |
|
2001 |
| 1. |
V. N. Belyaev, V. K. Bulitko, “$m$-Reducibility with Upper and Lower Bounds for the Reducing Functions”, Mat. Zametki, 70:1 (2001), 12–21    ; Math. Notes, 70:1 (2001), 11–19  |
1
|
|
1998 |
| 2. |
V. K. Bulitko, “Recursively compressible sets”, Mat. Zametki, 64:1 (1998), 9–16 ; Math. Notes, 64:1 (1998), 8–14 |
1
|
|
1992 |
| 3. |
V. K. Bulitko, “Sub-Turing reducibilities of bounded complexity”, Izv. Vyssh. Uchebn. Zaved. Mat., 1992, no. 1, 27–37 ; Russian Math. (Iz. VUZ), 36:1 (1992), 25–36 |
2
|
|
1991 |
| 4. |
V. K. Bulitko, “On ways of characterizing complete sets”, Izv. Akad. Nauk SSSR Ser. Mat., 55:2 (1991), 227–253 ; Math. USSR-Izv., 38:2 (1992), 225–249 |
5
|
| 5. |
V. K. Bulitko, “On $1/n$-hereditary sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 6, 3–11 ; Soviet Math. (Iz. VUZ), 35:6 (1991), 1–9 |
|
1985 |
| 6. |
V. K. Bulitko, “Boolean classes of Turing reductions”, Izv. Akad. Nauk SSSR Ser. Mat., 49:1 (1985), 3–31 ; Math. USSR-Izv., 26:1 (1986), 1–29 |
1
|
|
1980 |
| 7. |
V. K. Bulitko, “Reducibility via Zhegalkin's linear tables”, Sibirsk. Mat. Zh., 21:3 (1980), 23–31 ; Siberian Math. J., 21:3 (1980), 332–339 |
5
|
|
1978 |
| 8. |
V. K. Bulitko, D. P. Probst, “On Computations with Limited Storage of Entries”, Probl. Peredachi Inf., 14:4 (1978), 105–108 ; Problems Inform. Transmission, 14:4 (1978), 313–315 |
|
1973 |
| 9. |
V. K. Bulitko, “Об одной алгоритмически неразрешимой массовой задаче для графов”, Upravliaemie systemy, 1973, no. 11, 61–73 |
| 10. |
V. K. Bulitko, “Graphs with prescribed environments of the vertices”, Trudy Mat. Inst. Steklov., 133 (1973), 78–94 ; Proc. Steklov Inst. Math., 133 (1977), 77–94 |
1
|
|
|
|
1992 |
| 11. |
V. K. Bulitko, “Letter to the editor”, Izv. RAN. Ser. Mat., 56:4 (1992), 907 ; Russian Acad. Sci. Izv. Math., 41:1 (1993), 185 |
1
|
|
| Organisations |
|
|
