Nikolai K. Vereshchagin
Orcid: 0000-0002-7386-979X
According to our database1,
Nikolai K. Vereshchagin
authored at least 86 papers
between 1992 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
5
10
3
2
2
2
2
2
2
2
2
1
1
1
8
1
3
1
1
6
2
7
2
1
2
1
1
1
1
2
1
2
3
2
2
2
2
1
1
1
3
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2023
Theor. Comput. Sci., 2023
Half-duplex communication complexity with adversary? can be less than the classical communication complexity.
Electron. Colloquium Comput. Complex., 2023
2022
Electron. Colloquium Comput. Complex., 2022
Discret. Comput. Geom., 2022
2021
Proofs of conservation inequalities for Levin's notion of mutual information of 1974.
Theor. Comput. Sci., 2021
2020
2018
IEEE Trans. Inf. Theory, 2018
2017
Theory Comput. Syst., 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the Computability and Complexity, 2017
2016
Theory Comput. Syst., 2016
Algorithmica, 2016
2015
2014
Proceedings of the Descriptional Complexity of Formal Systems, 2014
Proceedings of the Computer Science - Theory and Applications, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
2011
Improving on Gutfreund, Shaltiel, and Ta-Shma's paper "If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances".
Electron. Colloquium Comput. Complex., 2011
2010
IEEE Trans. Inf. Theory, 2010
Theory Comput. Syst., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
2009
Proceedings of the Mathematical Theory and Computational Practice, 2009
2008
Kolmogorov Complexity and Games.
Bull. EATCS, 2008
Proceedings of the Logic, 2008
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008
2007
Theor. Comput. Sci., 2007
Proceedings of the Computer Science, 2007
Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007
2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
2005
Electron. Colloquium Comput. Complex., 2005
2004
Electron. Colloquium Comput. Complex., 2004
Proceedings of the STACS 2004, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Inf. Comput., 2003
2002
Theor. Comput. Sci., 2002
Upper semi-lattice of binary strings with the relation "x is simple conditional to y".
Theor. Comput. Sci., 2002
Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002
Basic set theory.
Student mathematical library 17, American Mathematical Society, ISBN: 978-0-8218-2731-4, 2002
2001
Electron. Colloquium Comput. Complex., 2001
Electron. Colloquium Comput. Complex., 2001
2000
J. Comput. Syst. Sci., 2000
1999
Electron. Colloquium Comput. Complex., 1999
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
Provability, complexity, grammars.
American Mathematical Society translations series 2 192, American Mathematical Society, ISBN: 978-0-8218-1078-1, 1999
1998
Proceedings of the Foundations of Software Science and Computation Structure, 1998
1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes.
Theor. Comput. Sci., 1996
1995
Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
How to Use Expert Advice in the Case when Actual Values of Estimated Events Remain Unknown.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995
1993
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993
1992
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992