Skip to main content
  • Conference proceedings
  • © 2008

Computer Science - Theory and Applications

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5010)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CSR: International Computer Science Symposium in Russia

Conference proceedings info: CSR 2008.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (39 papers)

  1. Front Matter

  2. Opening Lecture

  3. Theory Track

    1. Topological Semantics of Justification Logic

      • Sergei Artemov, Elena Nogina
      Pages 30-39
    2. A Logspace Algorithm for Partial 2-Tree Canonization

      • Vikraman Arvind, Bireswar Das, Johannes Köbler
      Pages 40-51
    3. Computing Longest Common Substrings Via Suffix Arrays

      • Maxim A. Babenko, Tatiana A. Starikovskaya
      Pages 64-75
    4. Logic and Rational Languages of Words Indexed by Linear Orderings

      • Nicolas Bedon, Alexis Bès, Olivier Carton, Chloé Rispal
      Pages 76-85
    5. Complexity of the Bollobás-Riordan Polynomial

      • Markus Bläser, Holger Dell, Johann A. Makowsky
      Pages 86-98
    6. A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames

      • Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
      Pages 99-109
    7. Synchronization of Grammars

      • Didier Caucal, Stéphane Hassen
      Pages 110-121
    8. A Semantic Proof of Polytime Soundness of Light Affine Logic

      • Ugo Dal Lago, Martin Hofmann
      Pages 134-145
    9. On Subword Complexity of Morphic Sequences

      • Rostislav Deviatov
      Pages 146-157
    10. Comparing Universal Covers in Polynomial Time

      • Jiří Fiala, Daniël Paulusma
      Pages 158-167
    11. S4LP and Local Realizability

      • Melvin Fitting
      Pages 168-179

Other Volumes

  1. Computer Science – Theory and Applications

About this book

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
  • algorithm analysis and problem complexity

Bibliographic Information

  • Book Title: Computer Science - Theory and Applications

  • Book Subtitle: 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

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-540-79709-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2008

  • Softcover ISBN: 978-3-540-79708-1Published: 08 May 2008

  • eBook ISBN: 978-3-540-79709-8Published: 14 May 2008

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIII, 411

  • Topics: Theory of Computation, Algorithms, Artificial Intelligence, Mathematics of Computing, Bioinformatics

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions