|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
M. Kovačević, “On the maximum number of non-confusable strings evolving under short tandem duplications”, Probl. Peredachi Inf., 58:2 (2022), 12–23  |
|
2021 |
| 2. |
M. Kovačević, “On the maximum entropy of a sum of independent discrete random variables”, Teor. Veroyatnost. i Primenen., 66:3 (2021), 601–609   ; Theory Probab. Appl., 66:3 (2021), 482–487  |
1
|
|
2020 |
| 3. |
M. Kovačević, “Signaling to relativistic observers: an Einstein–Shannon–Riemann encounter”, Probl. Peredachi Inf., 56:4 (2020), 3–9 ; Problems Inform. Transmission, 56:4 (2020), 303–308  |
2
|
|
2015 |
| 4. |
M. Kovačević, I. Stanojević, V. Šenk, “Information-geometric equivalence of transportation polytopes”, Probl. Peredachi Inf., 51:2 (2015), 20–26 ; Problems Inform. Transmission, 51:2 (2015), 103–109 |
|
2013 |
| 5. |
M. Kovačević, I. Stanojević, V. Šenk, “Some properties of Rényi entropy over countably infinite alphabets”, Probl. Peredachi Inf., 49:2 (2013), 3–16 ; Problems Inform. Transmission, 49:2 (2013), 99–110 |
6
|
|
| Organisations |
|
| |
|
|
Contact us: