| Publications in Math-Net.Ru |
|
2018 |
| 1. |
K. Yu. Gorbunov, V. A. Lyubetsky, “A linear algorithm for restructuring a graph”, Avtomat. i Telemekh., 2018, 12, 124–141   ; Autom. Remote Control, 79:12 (2018), 2203–2216   |
|
2017 |
| 2. |
K. Yu. Gorbunov, V. A. Lyubetsky, “Algorithm of transformation of a graph into another one with minimal cost”, Inform. Primen., 11:1 (2017), 79–89 |
| 3. |
K. Yu. Gorbunov, V. A. Lyubetsky, “Linear algorithm for minimal rearrangement of structures”, Probl. Peredachi Inf., 53:1 (2017), 60–78 ; Problems Inform. Transmission, 53:1 (2017), 55–72 |
|
2015 |
| 4. |
An. A. Muchnik, K. Yu. Gorbunov, “Algorithmic aspects of decomposition and equivalence of finite-valued transducers”, Probl. Peredachi Inf., 51:3 (2015), 70–92 ; Problems Inform. Transmission, 51:3 (2015), 267–288 |
|
2012 |
| 5. |
K. Yu. Gorbunov, A. V. Seliverstov, V. A. Lyubetsky, “Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube”, Probl. Peredachi Inf., 48:2 (2012), 113–120 ; Problems Inform. Transmission, 48:2 (2012), 185–192 |
|
2011 |
| 6. |
K. Yu. Gorbunov, V. A. Lyubetsky, “The tree nearest on average to a given set of trees”, Probl. Peredachi Inf., 47:3 (2011), 64–79  ; Problems Inform. Transmission, 47:3 (2011), 274–288 |
|
2007 |
| 7. |
K. Yu. Gorbunov, “Estimation of the Number of Elements in a Covering of an Arbitrary
Randomness Test by Frequency Tests”, Probl. Peredachi Inf., 43:1 (2007), 56–66 ; Problems Inform. Transmission, 43:1 (2007), 48–56 |
|
2003 |
| 8. |
K. Yu. Gorbunov, “A Generalization of the Hilbert Basis Theorem”, Mat. Zametki, 74:4 (2003), 508–516  ; Math. Notes, 74:4 (2003), 483–490 |
|
1991 |
| 9. |
K. Yu. Gorbunov, “There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages”, Mat. Zametki, 50:1 (1991), 34–40 ; Math. Notes, 50:1 (1991), 683–690 |
|
Terms of Use