Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 2009

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

  • Conference proceedings
  • © 2009
Download book PDF

Overview

Editors:
  1. Rastislav Královič

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Damian Niwiński

    1. Members of EACSL Jury for the Ackermann Award, Poland

    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 5734)

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

Included in the following conference series:

Conference proceedings info: MFCS 2009.

Buy print copy

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

Table of contents (63 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Papers

    1. Four Subareas of the Theory of Constraints, and Their Links

      • Albert Atserias
      Pages 1-1
      Download chapter PDF

    2. Synchronization of Regular Automata

      • Didier Caucal
      Pages 2-23
      Download chapter PDF

    3. Stochastic Process Creation

      • Javier Esparza
      Pages 24-33
      Download chapter PDF

    4. Stochastic Games with Finitary Objectives

      • Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
      Pages 34-54
      Download chapter PDF

    5. Stochastic Data Streams

      • S. Muthukrishnan
      Pages 55-55
      Download chapter PDF

    6. Recent Advances in Population Protocols

      • Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis
      Pages 56-76
      Download chapter PDF

    7. How to Sort a Train

      • Peter Widmayer
      Pages 77-77
      Download chapter PDF

  3. Contributed Papers

    1. Arithmetic Circuits, Monomial Algebras and Finite Automata

      • Vikraman Arvind, Pushkar S. Joglekar
      Pages 78-89
      Download chapter PDF

    2. An Improved Approximation Bound for Spanning Star Forest and Color Saving

      • Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
      Pages 90-101
      Download chapter PDF

    3. Energy-Efficient Communication in Multi-interface Wireless Networks

      • Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
      Pages 102-111
      Download chapter PDF

    4. Private Capacities in Mechanism Design

      • Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
      Pages 112-123
      Download chapter PDF

    5. Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules

      • Nadja Betzler, Britta Dorn
      Pages 124-136
      Download chapter PDF

    6. Sampling Edge Covers in 3-Regular Graphs

      • Ivona Bezáková, William A. Rummler
      Pages 137-148
      Download chapter PDF

    7. Balanced Paths in Colored Graphs

      • Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano
      Pages 149-161
      Download chapter PDF

    8. Few Product Gates But Many Zeros

      • Bernd Borchert, Pierre McKenzie, Klaus Reinhardt
      Pages 162-174
      Download chapter PDF

    9. Branching Programs for Tree Evaluation

      • Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr
      Pages 175-186
      Download chapter PDF

    10. A Dichotomy Theorem for Polynomial Evaluation

      • Irénée Briquel, Pascal Koiran
      Pages 187-198
      Download chapter PDF

    11. DP-Complete Problems Derived from Extremal NP-Complete Properties

      • Yi Cao, Joseph Culberson, Lorna Stewart
      Pages 199-210
      Download chapter PDF

    12. The Synchronization Problem for Locally Strongly Transitive Automata

      • Arturo Carpi, Flavio D’Alessandro
      Pages 211-222
      Download chapter PDF
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2009

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation