Skip to main content
  • Conference proceedings
  • © 2006

Mathematical Foundations of Computer Science 2006

31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Conference proceedings info: MFCS 2006.

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 (69 papers)

  1. Front Matter

  2. Invited Talks

    1. A Core Calculus for Scala Type Checking

      • Vincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky
      Pages 1-23
    2. Tree Exploration with an Oracle

      • Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
      Pages 24-37
  3. Contributed Papers

    1. Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles

      • O. Aichholzer, C. Huemer, S. Kappes, B. Speckmann, C. D. Tóth
      Pages 86-97
    2. Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

      • Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
      Pages 98-109
    3. The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems

      • Richard Beigel, William Gasarch, James Glenn
      Pages 146-156
    4. Crochemore Factorization of Sturmian and Other Infinite Words

      • Jean Berstel, Alessandra Savelli
      Pages 157-166
    5. Equations on Partial Words

      • F. Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
      Pages 167-178
    6. Concrete Multiplicative Complexity of Symmetric Functions

      • Joan Boyar, René Peralta
      Pages 179-189
    7. On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures

      • Laurent Boyer, Victor Poupet, Guillaume Theyssier
      Pages 190-201
    8. The Kleene Equality for Graphs

      • Arnaud Carayol, Didier Caucal
      Pages 214-225

Other Volumes

  1. Mathematical Foundations of Computer Science 2006

Editors and Affiliations

  • Department of Computer Science, Comenius University, Mlynská dolina, Bratislava, Slovakia

    Rastislav Královič

  • Institute of Informatics, University of Warsaw, Poland

    Paweł Urzyczyn

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