|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
M. A. Mestetskiy, M. S. Shupletsov, “Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions”, Diskr. Mat., 35:1 (2023), 71–81  ; Discrete Math. Appl., 34:4 (2024), 211–219 |
|
2017 |
| 2. |
S. A. Lozhkin, M. S. Shupletsov, B. R. Danilov, “Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference”, Mat. Vopr. Kriptogr., 8:2 (2017), 87–96   |
1
|
|
2014 |
| 3. |
S. A. Lozhkin, M. S. Shupletsov, “Switching activity of Boolean circuits and synthesis of Boolean circuits with asymptotically optimal complexity and linear switching activity”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014), 84–97 |
1
|
|
2009 |
| 4. |
M. S. Shupletsov, “High Accuracy Asymptotic Bounds for Predicate Circuits over a Class of Specific Predicate Bases”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 173–184 |
|
| Organisations |
|
|
