Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2006

Computer Science -- Theory and Applications

First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings

Editors:

  1. Dima Grigoriev

    1. IRMAR, Université de Rennes, Rennes Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. John Harrison

    1. Intel Corporation, Hillsboro, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Edward A. Hirsch

    1. Steklov Institute of Mathematics at St. Petersburg, Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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 2006.

Sections

Buy it now

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

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (67 papers)

  1. Front Matter

    PDF

  2. Invited Papers

    3. Synchronous Elastic Circuits

      • Mike Kishinevsky, Jordi Cortadella, Bill Grundmann, Sava Krstić, John O’Leary
      Pages 3-5

  3. Theory Track

    1. SZK Proofs for Black-Box Group Problems

      • V. Arvind, Bireswar Das
      Pages 6-17

    2. Canonical Decomposition of a Regular Factorial Language

      • S. V. Avgustinovich, A. E. Frid
      Pages 18-22

    4. Inductive Type Schemas as Functors

      • Freiric Barral, Sergei Soloviev
      Pages 35-45

    5. Unfolding Synthesis of Asynchronous Automata

      • Nicolas Baudru, Rémi Morin
      Pages 46-57

    6. Conjugacy and Equivalence of Weighted Automata and Functional Transducers

      • Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
      Pages 58-69

    7. Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees

      • Piotr Berman, Martin Fürer, Alexander Zelikovsky
      Pages 70-79

    8. Tuples of Disjoint NP-Sets

      • Olaf Beyersdorff
      Pages 80-91

    10. Planar Dimer Tilings

      • Olivier Bodini, Thomas Fernique
      Pages 104-113

    11. The Complexity of Equality Constraint Languages

      • Manuel Bodirsky, Jan Kára
      Pages 114-126

    12. Window Subsequence Problems for Compressed Texts

      • Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich
      Pages 127-136
Back to top

Other Volumes

  1. Computer Science – Theory and Applications

Back to top

Keywords

Back to top

Editors and Affiliations

  • IRMAR, Université de Rennes, Rennes Cedex, France

    Dima Grigoriev

  • Intel Corporation, Hillsboro, USA

    John Harrison

  • Steklov Institute of Mathematics at St. Petersburg, Petersburg, Russia

    Edward A. Hirsch

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation