|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
An. A. Muchnik, A. L. Semenov, “Lattice of Definability in the Order of Rational Numbers”, Mat. Zametki, 108:1 (2020), 102–118    ; Math. Notes, 108:1 (2020), 94–107   |
1
|
|
2015 |
| 2. |
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 |
3
|
|
2013 |
| 3. |
An. A. Muchnik, “Determinization of ordinal automata”, Probl. Peredachi Inf., 49:2 (2013), 58–72 ; Problems Inform. Transmission, 49:2 (2013), 149–162 |
|
2011 |
| 4. |
Andrej A. Muchnik, “Kolmogorov complexity and cryptography”, Trudy Mat. Inst. Steklova, 274 (2011), 210–221 ; Proc. Steklov Inst. Math., 274 (2011), 193–203 |
4
|
| 5. |
Nikolay K. Vereshchagin, Andrej A. Muchnik, “On joint conditional complexity (entropy)”, Trudy Mat. Inst. Steklova, 274 (2011), 103–118 ; Proc. Steklov Inst. Math., 274 (2011), 90–104 |
4
|
|
2010 |
| 6. |
An. A. Muchnik, A. E. Romashchenko, “Stability of properties of Kolmogorov complexity under relativization”, Probl. Peredachi Inf., 46:1 (2010), 42–67 ; Problems Inform. Transmission, 46:1 (2010), 38–61 |
7
|
|
2009 |
| 7. |
An. A. Muchnik, “Algorithmic randomness and splitting of supermartingales”, Probl. Peredachi Inf., 45:1 (2009), 60–70  ; Problems Inform. Transmission, 45:1 (2009), 54–64 |
1
|
| 8. |
An. A. Muchnik, Yu. L. Pritykin, A. L. Semenov, “Sequences close to periodic”, Uspekhi Mat. Nauk, 64:5(389) (2009), 21–96 ; Russian Math. Surveys, 64:5 (2009), 805–871 |
20
|
|
2003 |
| 9. |
An. A. Muchnik, A. L. Semenov, “On the Role of the Law of Large Numbers in the
Theory of Randomness”, Probl. Peredachi Inf., 39:1 (2003), 134–165 ; Problems Inform. Transmission, 39:1 (2003), 119–147 |
4
|
|
1999 |
| 10. |
An. A. Muchnik, S. E. Positsel'skii, “A class of enumerable sets”, Uspekhi Mat. Nauk, 54:3(327) (1999), 171–172 ; Russian Math. Surveys, 54:3 (1999), 640–641 |
1
|
|
1987 |
| 11. |
An. A. Muchnik, “Lower Limits of Frequences for Computable Sequences and Relativitized a priori Probabilities”, Teor. Veroyatnost. i Primenen., 32:3 (1987), 563–565 ; Theory Probab. Appl., 32:3 (1987), 513–514 |
4
|
|
1985 |
| 12. |
An. A. Muchnik, “The basic structures of the descriptive theory of algorithms”, Dokl. Akad. Nauk SSSR, 285:2 (1985), 280–283 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: