Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 2003

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

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Branislav Rovan

    1. Department of Computer Science, Comenius University, Bratislava, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Vojtáš

    1. Charles University, Prague, Czech Republic

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

Included in the following conference series:

Conference proceedings info: MFCS 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (62 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Distributed Quantum Computing

      • Harry Buhrman, Hein Röhrig
      Pages 1-20

    2. Selfish Routing in Non-cooperative Networks: A Survey

      • R. Feldmann, M. Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
      Pages 21-45

    3. Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols

      • Roberto Gorrieri, Fabio Martinelli
      Pages 46-67

    4. Semantic and Syntactic Approaches to Simulation Relations

      • Jo Hannay, Shin-ya Katsumata, Donald Sannella
      Pages 68-91

    5. On the Computational Complexity of Conservative Computing

      • Giancarlo Mauri, Alberto Leporati
      Pages 92-112

    6. Constructing Infinite Graphs with a Decidable MSO-Theory

      • Wolfgang Thomas
      Pages 113-124

    7. Towards a Theory of Randomized Search Heuristics

      • Ingo Wegener
      Pages 125-141

  3. Contributed Papers

    1. Adversarial Models for Priority-Based Networks

      • C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, M. Serna
      Pages 142-151

    2. On Optimal Merging Networks

      • Kazuyuki Amano, Akira Maruoka
      Pages 152-161

    3. Problems which Cannot Be Reduced to Any Proper Subproblems

      • Klaus Ambos-Spies
      Pages 162-168

    4. ACID-Unification Is NEXPTIME-Decidable

      • Siva Anantharaman, Paliath Narendran, Michael Rusinowitch
      Pages 169-178

    5. Completeness in Differential Approximation Classes

      • G. Ausiello, C. Bazgan, M. Demange, V. Th. Paschos
      Pages 179-188

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

      • Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
      Pages 189-197

    7. Smoothed Analysis of Three Combinatorial Problems

      • Cyril Banderier, René Beier, Kurt Mehlhorn
      Pages 198-207

    8. Inferring Strings from Graphs and Arrays

      • Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
      Pages 208-217

    9. Faster Algorithms for k-Medians in Trees

      • Robert Benkoczi, Binay Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
      Pages 218-227

    10. Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies

      • F. Blanchard, J. Cervelle, E. Formenti
      Pages 228-238

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

      • Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
      Pages 239-248

    12. Error-Bounded Probabilistic Computations between MA and AM

      • Elmar Böhler, Christian Glaßer, Daniel Meister
      Pages 249-258
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2003

Keywords

Editors and Affiliations

  • Department of Computer Science, Comenius University, Bratislava, Slovakia

    Branislav Rovan

  • Charles University, Prague, Czech Republic

    Peter Vojtáš

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation