Skip to main content
  • Conference proceedings
  • © 2009

Mathematical Foundations of Computer Science 2009

34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, Proceedings

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

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

Conference series link(s): MFCS: International Symposium on Mathematical Foundations of Computer Science

Conference proceedings info: MFCS 2009.

Buy it now

Buying options

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 (63 papers)

  1. Front Matter

  2. Invited Papers

    1. Synchronization of Regular Automata

      • Didier Caucal
      Pages 2-23
    2. Stochastic Process Creation

      • Javier Esparza
      Pages 24-33
    3. Stochastic Games with Finitary Objectives

      • Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
      Pages 34-54
    4. Stochastic Data Streams

      • S. Muthukrishnan
      Pages 55-55
    5. Recent Advances in Population Protocols

      • Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
      Pages 56-76
    6. How to Sort a Train

      • Peter Widmayer
      Pages 77-77
  3. Contributed Papers

    1. Arithmetic Circuits, Monomial Algebras and Finite Automata

      • Vikraman Arvind, Pushkar S. Joglekar
      Pages 78-89
    2. An Improved Approximation Bound for Spanning Star Forest and Color Saving

      • Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
      Pages 90-101
    3. Energy-Efficient Communication in Multi-interface Wireless Networks

      • Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
      Pages 102-111
    4. Private Capacities in Mechanism Design

      • Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
      Pages 112-123
    5. Sampling Edge Covers in 3-Regular Graphs

      • Ivona Bezáková, William A. Rummler
      Pages 137-148
    6. Balanced Paths in Colored Graphs

      • Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano
      Pages 149-161
    7. Few Product Gates But Many Zeros

      • Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
      Pages 162-174
    8. Branching Programs for Tree Evaluation

      • Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr
      Pages 175-186
    9. A Dichotomy Theorem for Polynomial Evaluation

      • Irénée Briquel, Pascal Koiran
      Pages 187-198
    10. DP-Complete Problems Derived from Extremal NP-Complete Properties

      • Yi Cao, Joseph Culberson, Lorna Stewart
      Pages 199-210
    11. The Synchronization Problem for Locally Strongly Transitive Automata

      • Arturo Carpi, Flavio D’Alessandro
      Pages 211-222

Other Volumes

  1. Mathematical Foundations of Computer Science 2009

Editors and Affiliations

  • Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV 0433-06, Bratislava, Slovakia

    Rastislav Královič

  • Members of EACSL Jury for the Ackermann Award, Poland

    Damian Niwiński

Bibliographic Information

Buy it now

Buying options

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