Mathematical Foundations of Computer Science 2008

1. Front Matter

   PDF

2. Invited Papers

   1. One Useful Logic That Defines Its Own Truth

      • Andreas Blass, Yuri Gurevich

      Pages 1-15

   2. On Synchronous and Asynchronous Interaction in Distributed Systems

      • Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke

      Pages 16-35

   3. A Robust Class of Regular Languages

      • Antonio Cano Gómez, Jean-Éric Pin

      Pages 36-51

   4. Deterministic Models of Communication Faults

      • Rastislav Královič, Richard Královič

      Pages 52-67

   5. Algebraic Graph Algorithms

      • Piotr Sankowski

      Pages 68-82

3. Contributed Papers

   1. Question/Answer Games on Towers and Pyramids

      • Sarmad Abbasi, Numan Sheikh

      Pages 83-95

   2. The Maximum Independent Set Problem in Planar Graphs

      • Vladimir E. Alekseev, Vadim Lozin, Dmitriy Malyshev, Martin Milanič

      Pages 96-107

   3. When Ignorance Helps: Graphical Multicast Cost Sharing Games

      • Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli

      Pages 108-119

   4. Shortest Synchronizing Strings for Huffman Codes

      • Marek Tomasz Biskup

      Pages 120-131

   5. Optimizing Conjunctive Queries over Trees Using Schema Information

      • Henrik Björklund, Wim Martens, Thomas Schwentick

      Pages 132-143

   6. Clustering with Partial Information

      • Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances Rosamond

      Pages 144-155

   7. Reoptimization of the Metric Deadline TSP

      • Hans-Joachim Böckenhauer, Dennis Komm

      Pages 156-167

   8. On the Shortest Linear Straight-Line Program for Computing Linear Forms

      • Joan Boyar, Philip Matthews, René Peralta

      Pages 168-179

   9. Flip Algorithm for Segment Triangulations

      • Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt

      Pages 180-192

   10. Computing Sharp 2-Factors in Claw-Free Graphs

       • Hajo Broersma, Daniël Paulusma

       Pages 193-204

   11. A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem

       • Ioannis Caragiannis, Gianpiero Monaco

       Pages 205-216

   12. Positional Strategies for Higher-Order Pushdown Parity Games

       • Arnaud Carayol, Michaela Slaats

       Pages 217-228

   13. Arthur and Merlin as Oracles

       • Venkatesan T. Chakaravarthy, Sambuddha Roy

       Pages 229-240

   14. A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

       • Emilie Charlier, Michel Rigo

       Pages 241-252

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.

• Automat
• algorithms
• artificial intelligence
• automata
• complexity
• computer science
• data structure
• data structures
• distributed computing
• formal language
• formal languages
• formal specification
• game theory
• semantics
• verification
• algorithm analysis and problem complexity

Policies and ethics