Skip to main content
  • Conference proceedings
  • © 2003

Mathematical Foundations of Computer Science 2003

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2747)

Conference series link(s): MFCS: International Symposium on Mathematical Foundations of Computer Science

Conference proceedings info: MFCS 2003.

Buy it now

Buying options

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

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

Table of contents (62 papers)

  1. Front Matter

  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. Semantic and Syntactic Approaches to Simulation Relations

      • Jo Hannay, Shin-ya Katsumata, Donald Sannella
      Pages 68-91
    4. On the Computational Complexity of Conservative Computing

      • Giancarlo Mauri, Alberto Leporati
      Pages 92-112
  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. ACID-Unification Is NEXPTIME-Decidable

      • Siva Anantharaman, Paliath Narendran, Michael Rusinowitch
      Pages 169-178
    4. Completeness in Differential Approximation Classes

      • G. Ausiello, C. Bazgan, M. Demange, V. Th. Paschos
      Pages 179-188
    5. On the Length of the Minimum Solution of Word Equations in One Variable

      • Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
      Pages 189-197
    6. Smoothed Analysis of Three Combinatorial Problems

      • Cyril Banderier, René Beier, Kurt Mehlhorn
      Pages 198-207
    7. Inferring Strings from Graphs and Arrays

      • Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
      Pages 208-217
    8. Faster Algorithms for k-Medians in Trees

      • Robert Benkoczi, Binay Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
      Pages 218-227
    9. Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies

      • F. Blanchard, J. Cervelle, E. Formenti
      Pages 228-238
    10. Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms

      • Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
      Pages 239-248
    11. Error-Bounded Probabilistic Computations between MA and AM

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

Other Volumes

  1. Mathematical Foundations of Computer Science 2003

Editors and Affiliations

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

    Branislav Rovan

  • Charles University, Prague, Czech Republic

    Peter Vojtáš

Bibliographic Information

Buy it now

Buying options

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