|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
D. S. Ananichev, K. L. Geut, S. S. Titov, “On codes with unique decoding to the nearest”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 138–140  |
|
2012 |
| 2. |
D. S. Ananichev, D. D. Dublennykh, “Lower bounds for the number of keys in Zakrevskij cipher”, Zap. Nauchn. Sem. POMI, 402 (2012), 40–44  ; J. Math. Sci. (N. Y.), 192:3 (2013), 279–281  |
| 3. |
D. S. Ananichev, M. V. Volkov, V. V. Gusev, “Primitive digraphs with large exponents and slowly synchronizing automata”, Zap. Nauchn. Sem. POMI, 402 (2012), 9–39 ; J. Math. Sci. (N. Y.), 192:3 (2013), 263–278 |
33
|
|
2010 |
| 4. |
D. S. Ananichev, “The annulation threshold for partially monotonic automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 1, 3–13  ; Russian Math. (Iz. VUZ), 54:1 (2010), 1–9 |
2
|
|
1999 |
| 5. |
D. S. Ananichev, “Series of just-non-distributive varieties of Lie rings”, Fundam. Prikl. Mat., 5:4 (1999), 955–978 |
|
1998 |
| 6. |
D. S. Ananichev, M. V. Volkov, “Varieties of solvable Lie rings of finite width”, Mat. Zametki, 63:5 (1998), 643–650 ; Math. Notes, 63:5 (1998), 569–574  |
|
1995 |
| 7. |
D. S. Ananichev, “Almost distributive varieties of Lie rings”, Mat. Sb., 186:4 (1995), 3–20 ; Sb. Math., 186:4 (1995), 465–483 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: