Computer Science – Theory and Applications

Third International Computer Science Symposium in Russia, CSR 2008 Moscow, Russia, June 7-12, 2008 Proceedings

  • Editors
  • Edward A. Hirsch
  • Alexander A. Razborov
  • Alexei Semenov
  • Anatol Slissenko
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)

Table of contents

  1. Front Matter
  2. Opening Lecture

  3. Invited Papers

  4. Theory Track

    1. Sergei Artemov, Elena Nogina
      Pages 30-39
    2. Vikraman Arvind, Bireswar Das, Johannes Köbler
      Pages 40-51
    3. Maxim A. Babenko, Tatiana A. Starikovskaya
      Pages 64-75
    4. Nicolas Bedon, Alexis Bès, Olivier Carton, Chloé Rispal
      Pages 76-85
    5. Markus Bläser, Holger Dell, Johann A. Makowsky
      Pages 86-98
    6. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
      Pages 99-109
    7. Didier Caucal, Stéphane Hassen
      Pages 110-121
    8. Ugo Dal Lago, Martin Hofmann
      Pages 134-145
    9. Rostislav Deviatov
      Pages 146-157
    10. Jiří Fiala, Daniël Paulusma
      Pages 158-167
    11. Melvin Fitting
      Pages 168-179

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Third International Computer Science Symposium in Russia, CSR 2008, held in Moscow, Russia, June 7-12, 2008.

The 33 revised papers presented together with 5 invited papers and one opening lecture were carefully reviewed and selected from 103 submissions. All major areas in computer science are addressed. The theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory and applications of logic to computer science. The application part comprises programming and languages; computer architecture and hardware design; symbolic computing and numerical applications; application software; artificial intelligence and robotics.

Keywords

Automat Hardware algorithms artificial intelligence automata complexity computer architecture computer science data structure data structures formal language programming proof theory robot robotics

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-79709-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-79708-1
  • Online ISBN 978-3-540-79709-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book