|
|
|
Publications in Math-Net.Ru |
Citations |
|
2010 |
| 1. |
V. V. Skobelev, V. G. Skobelev, “Analysis of non-linear automata with delay 2 over a finite ring”, Prikl. Diskr. Mat., 2010, no. 1(7), 68–85  |
2
|
|
2009 |
| 2. |
V. G. Skobelev, “Combinatorics-algebraic models in cryptography”, Prikl. Diskr. Mat., 2009, no. supplement № 2, 74–114 |
1
|
|
2008 |
| 3. |
V. G. Skobelev, “Analysis of attacks onto quantum public key distribution system”, Prikl. Diskr. Mat., 2008, no. 2(2), 62–66 |
| 4. |
E. A. Ivaschenko, V. G. Skobelev, “Presentation of cryptosystems via polybasic algebraic system”, Prikl. Diskr. Mat., 2008, no. 2(2), 33–38 |
| 5. |
V. A. Sukhinin, V. G. Skobelev, “Automaton identification in the class of Sprott's automata”, Prikl. Diskr. Mat., 2008, no. 1(1), 131–135 |
| 6. |
I. A. Naumenko, V. G. Skobelev, “Transformation of grids to 1-fault-tolerant graphs”, Prikl. Diskr. Mat., 2008, no. 1(1), 111–115 |
|
1989 |
| 7. |
A. S. Barashko, V. G. Skobelev, “Statistically reducible automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 2, 6–10  ; Soviet Math. (Iz. VUZ), 33:2 (1989), 5–10 |
|
1988 |
| 8. |
V. G. Skobelev, “On studies of combinational circuit controllability”, Avtomat. i Telemekh., 1988, no. 1, 136–141  ; Autom. Remote Control, 49:1 (1988), 109–113 |
|
1981 |
| 9. |
V. G. Skobelev, “Methods of designing minimal diagnostic words for an automaton and complexity of their implementation”, Avtomat. i Telemekh., 1981, no. 6, 162–169 ; Autom. Remote Control, 42:6 (1981), 832–837 |
|
| Organisations |
|
| |
|
|
Contact us: