Nikolay K. Vereshchagin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
6
Venues
2
Active years
2009–2014
Best venue rank
National
Where they publish
Papers
6 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2014 | CSR | Randomized Communication Complexity of Approximating Kolmogorov Complexity. | Nikolay K. Vereshchagin |
| 2013 | CiE | On Algorithmic Strong Sufficient Statistics. | Nikolay K. Vereshchagin |
| 2013 | CSR | 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". | Nikolay K. Vereshchagin |
| 2010 | CSR | An Encoding Invariant Version of Polynomial Time Computable Distributions. | Nikolay K. Vereshchagin |
| 2009 | CiE | Algorithmic Minimal Sufficient Statistic Revisited. | Nikolay K. Vereshchagin |
| 2009 | CSR | Kolmogorov Complexity and Model Selection. | Nikolay K. Vereshchagin |