Table of contents

  1. Front Matter
  2. Scott Aaronson
    Pages 1-14
  3. Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
    Pages 29-42
  4. Manindra Agrawal
    Pages 43-49
  5. Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
    Pages 77-90
  6. Alexander Shen
    Pages 105-119
  7. Alex Davydow, Sergey I. Nikolenko
    Pages 148-161
  8. Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven
    Pages 181-194
  9. Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
    Pages 195-208

About these proceedings

Introduction

This book constitutes the proceedings of the 6th International Computer Science Symposium in Russia, CSR 2011, held in St. Petersburg, Russia, in June 2011. The 29 papers presented were carefully reviewed and selected from 76 submissions. The scope of topics of the symposium was quite broad and covered basically all areas of the foundations of theoretical computer science.

Keywords

algorithms automata theory computational complexity context-free languages decidability

Editors and affiliations

  • Alexander Kulikov
    • 1
  • Nikolay Vereshchagin
    • 2
  1. 1.Steklov Institute of Mathematics at St. PetersburgSt.PetersburgRussia
  2. 2.Department of Mathematical Logic and Theory of AlgorithmsMoscow State UniversityMoscowRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-20712-9
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-20711-2
  • Online ISBN 978-3-642-20712-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book