|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
1. |
V. Zhmud, L. Dimitrov, G. Sablina, H. Roth, J. Nosek, W. Hardt, “On the expediency and possibilities of approximating a pure delay link”, Informatics and Automation, 21:1 (2022), 41–67 |
1
|
|
2018 |
2. |
V. V. Pechenkin, M. S. Korolev, L. V. Dimitrov, “Applied aspects of ranking algorithms for oriented weighted graphs (on the example of social network graphs)”, Tr. SPIIRAN, 61 (2018), 94–118 |
5
|
|
Organisations |
|
|