Yandex Best Paper Awards

Each year since 2007, Yandex provides Best Paper Awards and Best Student Paper Awards to the authors of papers selected by the Program Committee from those accepted to the CSR conference. In the past years the recepients were
 
  1. Best Papers:
    Artur Jez and Alexander Okhotin: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth,
    Yury Lifshits and Dirk Nowotka: Estimation of the click volume by large scale regression analysis.
    Best Student Paper:
    Maxim Babenko: A fast algorithm for path 2-packing problem.
  2. Best Papers:
    Marius Zimand: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences,
    Laura Kovács: Invariant generation for P-solvable loops with assignments.
    Best Student Paper:
    Vladimir Podolskii: A uniform lower bound on weights of perceptrons.
  3. Best Student Papers:
    Dmitry Itsykson: Structural complexity of AvgBPP,
    Yuri Pritykin and Julya Ulyashkina: Aperiodicity measure for infinite sequences.
  4. Best Paper:
    Dmitry Itsykson: Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms,
    Best Student Paper:
    Junhua Yu: Prehistoric Phenomena and Self-referentiality.
  5. Best Paper:
    Scott Aaronson: The Equivalence of Sampling and Searching,
    Best Student Paper:
    Daniil Musatov: Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization.