Volume 55, Issue 2

August 2014

Computer Science Symposium in Russia

Issue Editor:

9 articles in this issue

Editorial
Nikolay Vereshchagin
EditorialNotes 01 December 2013 Pages: 279 - 280
The Equivalence of Sampling and Searching
Scott Aaronson
OriginalPaper 15 December 2013 Pages: 281 - 298
Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization
Daniil Musatov
OriginalPaper 26 October 2012 Pages: 299 - 312
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
Andrei Romashchenko
OriginalPaper 12 September 2012 Pages: 313 - 329
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
Klaus Meer
OriginalPaper 20 July 2013 Pages: 330 - 346
Join-Reachability Problems in Directed Graphs
Loukas Georgiadis
Stavros D. Nikolopoulos
Leonidas Palios
OriginalPaper 13 February 2013 Pages: 347 - 379
The Complexity of Solving Reachability Games Using Value and Strategy Iteration
Kristoffer Arnsfelt Hansen
Rasmus Ibsen-Jensen
Peter Bro Miltersen
OriginalPaper 06 December 2013 Pages: 380 - 403
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Arkadev Chattopadhyay
Ricard Gavaldà
Denis Thérien
OriginalPaper 05 July 2013 Pages: 404 - 420
Two-Way Automata Versus Logarithmic Space
Christos A. Kapoutsis
OriginalPaper 11 April 2013 Pages: 421 - 447

Search