Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Vereshchagin, Nikolay Konstantinovich
E-mail: , , ,

https://www.mathnet.ru/eng/person8803
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/213717

Publications in Math-Net.Ru Citations
2025
1. N. K. Vereshchagin, M. V. Dektiarev, “Half-duplex communication complexity with adversary can be less than the classical communication complexity”, Mat. Sb., 216:6 (2025),  3–45  mathnet  mathscinet; Sb. Math., 216:6 (2025), 742–779  isi  scopus
2. A. L. Semenov, M. A. Babenko, A. Ya. Belov, N. K. Vereshchagin, M. E. Vishnikin, E. E. Zolin, V. N. Krupski, S. L. Kuznetsov, V. A. Lyubetskii, A. A. Onoprienko, M. R. Pentus, S. F. Soprunov, A. A. Sorokin, V. B. Shehtman, T. L. Yavorskaya, “Chair of Mathematical Logic and Theory of Algorithms”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025, no. 1,  23–32  mathnet  elib; Moscow University Mathematics Bulletin, 80:1 (2025), 23–33
2023
3. N. K. Vereshchagin, A. L. Semenov, A. Kh. Shen', “Kolmogorov’s last discovery? (Kolmogorov and algorithmic statistics)”, Teor. Veroyatnost. i Primenen., 68:4 (2023),  719–750  mathnet  mathscinet; Theory Probab. Appl., 68:4 (2024), 582–606  scopus 1
2011
4. Nikolay K. Vereshchagin, Andrej A. Muchnik, “On joint conditional complexity (entropy)”, Trudy Mat. Inst. Steklova, 274 (2011),  103–118  mathnet  mathscinet  elib; Proc. Steklov Inst. Math., 274 (2011), 90–104  isi  elib  scopus 5
2003
5. N. K. Vereshchagin, D. P. Skvortsov, E. Z. Skvortsova, A. V. Chernov, “Variants of Realizability for Propositional Formulas and the Logic of Weak Excluded Middle”, Trudy Mat. Inst. Steklova, 242 (2003),  77–97  mathnet  mathscinet  zmath; Proc. Steklov Inst. Math., 242 (2003), 67–85 3
1995
6. N. K. Vereshchagin, “Oracle separation of complexity classes and lower bounds for perceptrons solving separation problems”, Izv. RAN. Ser. Mat., 59:6 (1995),  3–24  mathnet  mathscinet  zmath; Izv. Math., 59:6 (1995), 1103–1122  isi
1993
7. N. K. Vereshchagin, “Relativizable and nonrelativizable theorems in the polynomial theory of algorithms”, Izv. RAN. Ser. Mat., 57:2 (1993),  51–90  mathnet  mathscinet  zmath; Russian Acad. Sci. Izv. Math., 42:2 (1994), 261–298  isi 20
8. N. K. Vereshchagin, “The relation between $NP$ and co-$NP$ sets with respect to a random oracle”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 3,  31–39  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 37:3 (1993), 29–37 1
1990
9. N. K. Vereshchagin, “New proof of the solvability of the elementary theory of linearly ordered sets”, Mat. Zametki, 47:5 (1990),  31–38  mathnet  mathscinet  zmath; Math. Notes, 47:5 (1990), 444–449  isi
1986
10. N. K. Vereshchagin, “Effective upper bounds for the number of zeros of a linear recurrence sequence”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1986, no. 1,  25–30  mathnet  mathscinet  zmath
1985
11. N. K. Vereshchagin, “Occurrence of zero in a linear recursive sequence”, Mat. Zametki, 38:2 (1985),  177–189  mathnet  mathscinet  zmath; Math. Notes, 38:2 (1985), 609–615  isi 15
1984
12. N. K. Vereshchagin, “Zeros of linear recursive sequences”, Dokl. Akad. Nauk SSSR, 278:5 (1984),  1036–1039  mathnet  mathscinet  zmath

Presentations in Math-Net.Ru
1. Полудуплексная коммуникационная сложность
N. K. Vereshchagin
Mathematical seminar Faculty of Computer Science HSE
March 17, 2023 18:10   
2. Cамоподобные замощения плоскости многоугольниками
N. K. Vereshchagin

March 5, 2020 19:10   
3. Algorithmic statistics
N. K. Vereshchagin
Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences
May 23, 2019 16:00   
4. Колмогоровская сложность вычислимых 0-1-последовательностей
N. K. Vereshchagin
Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic"
December 24, 2018 12:35   
5. Алгоритмическая статистика
N. K. Vereshchagin
"Algorithmic problems in algebra and logic" (S.I.Adian seminar)
October 6, 2015 18:30
6. Информационная и коммуникационная сложность: общий и приватные источники случайности
N. K. Vereshchagin, A. Kozachinsky
Kolmogorov seminar on computational complexity and descriptive complexity
March 17, 2014 16:45
7. Communication complexity of approximation of Kolmogorov complexity
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
December 16, 2013 16:45
8. High Entropy Random Selection Protocols
N. K. Vereshchagin
Symposium on logic and computability "Logic and Computation Day"
June 7, 2013 11:00
9. Communicative information
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 8, 2013 16:45
10. Short lists with short programs in short time
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
December 17, 2012 16:45
11. Group representations and locally decodable codes
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
October 29, 2012 16:45
12. What we can compute given random strings as an oracle
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 28, 2012 16:45
13. The notion of zero knowledge
N. K. Vereshchagin
Kolmogorov seminar on computational complexity and descriptive complexity
April 23, 2012 16:45
14. On abstract resource semantics and computabilty logic
Nikolay Vereshchagin
International workshop "Logical Models of Reasoning and Computation"
February 2, 2012 12:45   
15. Algorithmic statistics
N. K. Vereshchagin
Globus Seminar
November 24, 2011 15:40   

Organisations