Mathematical Foundations of Computer Science 2005

30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings

Editors:

ISBN: 978-3-540-28702-5 (Print) 978-3-540-31867-5 (Online)

Table of contents (69 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-14

      Page Migration in Dynamic Networks

    2. No Access

      Book Chapter

      Pages 15-25

      Knot Theory, Jones Polynomial and Quantum Computing

    3. No Access

      Book Chapter

      Pages 26-38

      Interactive Algorithms 2005

    4. No Access

      Book Chapter

      Pages 39-51

      Some Computational Issues in Membrane Computing

    5. No Access

      Book Chapter

      Pages 52-56

      The Generalization of Dirac’s Theorem for Hypergraphs

    6. No Access

      Book Chapter

      Pages 57-57

      On the Communication Complexity of Co-linearity Problems

    7. No Access

      Book Chapter

      Pages 58-70

      An Invitation to Play

  3. Papers

    1. No Access

      Book Chapter

      Pages 71-82

      The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem

    2. No Access

      Book Chapter

      Pages 83-94

      On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions

    3. No Access

      Book Chapter

      Pages 95-106

      Pure Nash Equilibria in Games with a Large Number of Actions

    4. No Access

      Book Chapter

      Pages 107-118

      On the Complexity of Depth-2 Circuits with Threshold Gates

    5. No Access

      Book Chapter

      Pages 119-130

      Isomorphic Implication

    6. No Access

      Book Chapter

      Pages 131-143

      Abstract Numeration Systems and Tilings

    7. No Access

      Book Chapter

      Pages 144-155

      Adversarial Queueing Model for Continuous Network Dynamics

    8. No Access

      Book Chapter

      Pages 156-167

      Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time

    9. No Access

      Book Chapter

      Pages 168-179

      Regular Sets of Higher-Order Pushdown Stacks

    10. No Access

      Book Chapter

      Pages 180-191

      Linearly Bounded Infinite Graphs

    11. No Access

      Book Chapter

      Pages 192-211

      Basic Properties for Sand Automata

    12. No Access

      Book Chapter

      Pages 212-223

      A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs

    13. No Access

      Book Chapter

      Pages 224-235

      Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix

previous Page of 4