Mathematical Foundations of Computer Science 2003

28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings

Editors:

ISBN: 978-3-540-40671-6 (Print) 978-3-540-45138-9 (Online)

Table of contents (62 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-20

      Distributed Quantum Computing

    2. No Access

      Book Chapter

      Pages 21-45

      Selfish Routing in Non-cooperative Networks: A Survey

    3. No Access

      Book Chapter

      Pages 46-67

      Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols

    4. No Access

      Book Chapter

      Pages 68-91

      Semantic and Syntactic Approaches to Simulation Relations

    5. No Access

      Book Chapter

      Pages 92-112

      On the Computational Complexity of Conservative Computing

    6. No Access

      Book Chapter

      Pages 113-124

      Constructing Infinite Graphs with a Decidable MSO-Theory

    7. No Access

      Book Chapter

      Pages 125-141

      Towards a Theory of Randomized Search Heuristics

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 142-151

      Adversarial Models for Priority-Based Networks

    2. No Access

      Book Chapter

      Pages 152-161

      On Optimal Merging Networks

    3. No Access

      Book Chapter

      Pages 162-168

      Problems which Cannot Be Reduced to Any Proper Subproblems

    4. No Access

      Book Chapter

      Pages 169-178

      ACID-Unification Is NEXPTIME-Decidable

    5. No Access

      Book Chapter

      Pages 179-188

      Completeness in Differential Approximation Classes

    6. No Access

      Book Chapter

      Pages 189-197

      On the Length of the Minimum Solution of Word Equations in One Variable

    7. No Access

      Book Chapter

      Pages 198-207

      Smoothed Analysis of Three Combinatorial Problems

    8. No Access

      Book Chapter

      Pages 208-217

      Inferring Strings from Graphs and Arrays

    9. No Access

      Book Chapter

      Pages 218-227

      Faster Algorithms for k-Medians in Trees

    10. No Access

      Book Chapter

      Pages 228-238

      Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies

    11. No Access

      Book Chapter

      Pages 239-248

      Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms

    12. No Access

      Book Chapter

      Pages 249-258

      Error-Bounded Probabilistic Computations between MA and AM

    13. No Access

      Book Chapter

      Pages 259-268

      A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

previous Page of 4