Skip to main content
  • Conference proceedings
  • © 2010

Computer Science -- Theory and Applications

5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings

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

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

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (38 papers)

  1. Front Matter

  2. Algorithms for Energy Management

    • Susanne Albers
    Pages 1-11
  3. Sofic and Almost of Finite Type Tree-Shifts

    • Nathalie Aubrun, Marie-Pierre Béal
    Pages 12-24
  4. Proof-Based Design of Security Protocols

    • Nazim Benaissa, Dominique Méry
    Pages 25-36
  5. Realizability of Dynamic MSC Languages

    • Benedikt Bollig, Loïc Hélouët
    Pages 48-59
  6. The max quasi-independent set Problem

    • N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, O. Pottié
    Pages 60-71
  7. Equilibria in Quantitative Reachability Games

    • Thomas Brihaye, Véronique Bruyère, Julie De Pril
    Pages 72-83
  8. Quotient Complexity of Closed Languages

    • Janusz Brzozowski, Galina Jirásková, Chenglong Zou
    Pages 84-95
  9. Right-Sequential Functions on Infinite Words

    • Olivier Carton
    Pages 96-106
  10. Kernelization

    • Fedor V. Fomin
    Pages 107-108
  11. Zigzags in Turing Machines

    • Anahí Gajardo, Pierre Guillon
    Pages 109-119
  12. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online

    • Paweł Gawrychowski, Artur Jeż, Łukasz Jeż
    Pages 132-143
  13. Time Optimal d-List Colouring of a Graph

    • Nick Gravin
    Pages 156-168
  14. Classifying Rankwidth k-DH-Graphs

    • Ling-Ju Hung, Ton Kloks
    Pages 195-203

Other Volumes

  1. Computer Science – Theory and Applications

Editors and Affiliations

  • Dept. of Theoretical Cybernetics, Kazan State University, Kazan, Russia

    Farid Ablayev

  • Institut für Informatik, Technische Universität München, Garching, Germany

    Ernst W. Mayr

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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