Ausgabe 2/2014
Computer Science Symposium in Russia
Inhalt (9 Artikel)
Join-Reachability Problems in Directed Graphs
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
The Complexity of Solving Reachability Games Using Value and Strategy Iteration
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien