|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
S. I. Uvarov, “Sufficient condition for polynomial solvability of random 3-CNF formulas”, Dokl. RAN. Math. Inf. Proc. Upr., 518 (2024), 35–39   ; Dokl. Math., 110:4 (2024), 323–327 |
|
2020 |
| 2. |
S. I. Uvarov, “An improved generator for 3-CNF formulas”, Avtomat. i Telemekh., 2020, no. 1, 161–172 ; Autom. Remote Control, 81:1 (2020), 130–138   |
1
|
|
1989 |
| 3. |
V. P. Suprun, S. I. Uvarov, M. A. Chernyshov, “Data monitoring with quasi-sequential reading”, Avtomat. i Telemekh., 1989, no. 8, 159–168  ; Autom. Remote Control, 50:8 (1989), 1130–1137 |
|
1988 |
| 4. |
M. F. Karavai, S. I. Uvarov, “On minimal redundancy on reconfigurable uniform multiprocessor systems”, Avtomat. i Telemekh., 1988, no. 2, 149–159 ; Autom. Remote Control, 49:2 (1988), 242–250 |
|
1986 |
| 5. |
S. I. Uvarov, M. A. Chernyshov, “Maximum speed of information exchanging rings in parallel computers”, Avtomat. i Telemekh., 1986, no. 10, 151–156 ; Autom. Remote Control, 47:10 (1986), 1444–1449 |
1
|
| 6. |
S. I. Uvarov, “Analysis of the Control Structure in Multiprocessor Computing Systems”, Avtomat. i Telemekh., 1986, no. 4, 163–170 |
|
1985 |
| 7. |
S. I. Uvarov, “Estimate of the quality of a method for all construction of a schedule for carrying out a set of operations in a sequence specified by a graph”, Avtomat. i Telemekh., 1985, no. 12, 161–165  |
| 8. |
S. I. Uvarov, “One way of scheduling with graph-specified prediction”, Avtomat. i Telemekh., 1985, no. 7, 172–176 |
|
| Organisations |
|
| |
|
|
Contact us: