|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
O. I. Gorbaneva, S. S. Mikhalkovich, G. A. Ugol'nitskii, “Models of resource allocation in a hierarchically controlled tree-like dynamic system with consideration of opportunistic behavior of the agents”, UBS, 106 (2023), 96–137  |
|
2022 |
| 2. |
A. V. Goloveshkin, S. S. Mikhalkovich, “Robust algorithmic binding to arbitrary fragment of program code”, Program Systems: Theory and Applications, 13:1 (2022), 3–33  ; Program Systems: Theory and Applications, 13:1 (2022), 35–62 |
|
2018 |
| 3. |
A. V. Goloveshkin, S. S. Mikhalkovich, “Tolerant parsing with a special kind of «Any» symbol: the algorithm and practical application”, Proceedings of ISP RAS, 30:4 (2018), 7–28  |
4
|
|
2016 |
| 4. |
M. S. Malevannyy, S. S. Mikhalkovich, “Context-based model for concern markup of a source code”, Proceedings of ISP RAS, 28:2 (2016), 63–78 |
2
|
|
2015 |
| 5. |
Julia Belyakova, Stanislav Mikhalkovich, “Pitfalls of C# generics and their solution using concepts”, Proceedings of ISP RAS, 27:3 (2015), 29–46 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: