- Magnus Wahlström:
New Plain-Exponential Time Classes for Graph Homomorphism. CSR 2009: 346-355 - Abuzer Yakaryilmaz
, A. C. Cem Say
:
Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR 2009: 356-367 - Hongseok Yang:
Automatic Verification of Heap-Manipulating Programs Using Separation Logic. CSR 2009: 25 - Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner:
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings. Lecture Notes in Computer Science 5675, Springer 2009, ISBN 978-3-642-03350-6 [contents]