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. Contributed Papers

    1. A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves

      • Paul S. Bonsma, Tobias Brueggemann, Gerhard J. Woeginger
      Pages 259-268
    2. Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation

      • Michele Boreale, Maria Grazia Buscemi
      Pages 269-278
    3. Denotational Testing Semantics in Coinductive Form

      • Michele Boreale, Fabio Gadducci
      Pages 279-289
    4. Lower Bounds for General Graph–Driven Read–Once Parity Branching Programs

      • Henrik Brosenne, Matthias Homeister, Stephan Waack
      Pages 290-299
    5. The Minimal Graph Model of Lambda Calculus

      • Antonio Bucciarelli, Antonino Salibra
      Pages 300-307
    6. Unambiguous Automata on Bi-infinite Words

      • Olivier Carton
      Pages 308-317
    7. Relating Hierarchy of Temporal Properties to Model Checking

      • Ivana Černá, Radek Pelánek
      Pages 318-327
    8. Inverse NP Problems

      • Hubie Chen
      Pages 338-347
    9. A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs

      • Zhi-Zhong Chen, Mitsuharu Kouno
      Pages 348-357
    10. Randomized Algorithms for Determining the Majority on Graphs

      • Gianluca De Marco, Andrzej Pelc
      Pages 368-377
    11. Using Transitive–Closure Logic for Deciding Linear Properties of Monoids

      • Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas
      Pages 378-387
    12. Linear-Time Computation of Local Periods

      • Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
      Pages 388-397
    13. Approximation Schemes for the Min-Max Starting Time Problem

      • Leah Epstein, Tamir Tassa
      Pages 408-418
    14. Quantum Testers for Hidden Group Properties

      • Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
      Pages 419-428
    15. Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces

      • Paul Gastin, Madhavan Mukund, K. Narayan Kumar
      Pages 429-438
    16. LTL with Past and Two-Way Very-Weak Alternating Automata

      • Paul Gastin, Denis Oddoux
      Pages 439-448
    17. Match-Bounded String Rewriting Systems

      • Alfons Geser, Dieter Hofbauer, Johannes Waldmann
      Pages 449-459

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