Computer Science – Theory and Applications

8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings

  • Andrei A. Bulatov
  • Arseny M. Shur
Conference proceedings CSR 2013
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7913)

Table of contents

  1. Front Matter
  2. Opening Lecture

    1. Mario Szegedy
      Pages 1-11
  3. Session 1: Algorithms

    1. Klaus Jansen, Stefan Kraft
      Pages 12-23
    2. Volker Diekert, Armin Weiß
      Pages 24-35
    3. Paweł Gawrychowski
      Pages 36-48
  4. Invited Lecture 1

  5. Session 2: Automata

    1. Amaldev Manuel, Anca Muscholl, Gabriele Puppis
      Pages 64-75
    2. Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano
      Pages 100-111
  6. Invited Lecture 2

  7. Session 3: Logic, Proof Complexity

  8. Invited Lecture 3

    1. Ryan Williams
      Pages 174-182
  9. Session 4: Complexity 1

About these proceedings

Introduction

This book constitutes the proceedings of the 8th International Computer Science Symposium in Russia, CSR 2013, held in Ekaterinburg, Russia, in June 2013. The 29 full papers presented in this volume were carefully reviewed and selected from 52 submissions. In addition the book contains 8 invited lectures. The papers are organized in topical sections on: algorithms; automata; logic and proof complexity; complexity; words and languages; and logic and automata.

Keywords

computational complexity decidability formal methods multi-weighted automata prefix-free languages

Editors and affiliations

  • Andrei A. Bulatov
    • 1
  • Arseny M. Shur
    • 2
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.Institute of Mathematics and Computer ScienceUral Federal UniversityEkaterinburgRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-38536-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-38535-3
  • Online ISBN 978-3-642-38536-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book