Nikolai K. Vereshchagin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
17
Venues
12
Active years
1992–2022
Best venue rank
A*
Where they publish
Papers
17 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | CSR | How Much Randomness is Needed to Convert MA Protocols to AM Protocols? | Nikolai K. Vereshchagin |
| 2008 | ALT | On-Line Probability, Complexity and Randomness. | Alexey V. Chernov, Alexander Shen, Nikolai K. Vereshchagin, Vladimir Vovk |
| 2008 | WoLLIC | On Game Semantics of the Affine and Intuitionistic Logics. | Ilya Mezhirov, Nikolai K. Vereshchagin |
| 2007 | CSR | Inverting Onto Functions and Polynomial Hierarchy. | Harry Buhrman, Lance Fortnow, Michal Kouck, John D. Rogers, Nikolai K. Vereshchagin |
| 2006 | CSR | Shannon Entropy vs. Kolmogorov Complexity. | Andrei A. Muchnik, Nikolai K. Vereshchagin |
| 2006 | ISIT | On Algorithmic Rate-Distortion Function. | Nikolai K. Vereshchagin, Paul M. B. Vitnyi |
| 2006 | STACS | Kolmogorov Complexity with Error. | Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin |
| 2006 | TAMC | Non-reducible Descriptions for Conditional Kolmogorov Complexity. | Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin |
| 2005 | STACS | Increasing Kolmogorov Complexity. | Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin |
| 2004 | ICALP | Ecological Turing Machines. | Bruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin |
| 2004 | STACS | Individual Communication Complexity: Extended Abstract. | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitnyi |
| 2002 | CSL | Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle. | Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin |
| 2002 | FOCS | Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection. | Nikolai K. Vereshchagin, Paul M. B. Vitnyi |
| 1999 | STACS | Descriptive Complexity of Computable Sequences. | Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin |
| 1998 | FOSSACS | Deterministic Rational Transducers and Random Sequences. | Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin |
| 1995 | COLT | How to Use Expert Advice in the Case when Actual Values of Estimated Events Remain Unknown. | Olga Mitina, Nikolai K. Vereshchagin |
| 1992 | LFCS | Banishing Robust Turing Completeness. | Lane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin |