Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Mathematical Foundations of Computer Science 2006

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Rastislav Královič

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Paweł Urzyczyn

    1. Institute of Informatics, University of Warsaw, Poland

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

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

Included in the following conference series:

Conference proceedings info: MFCS 2006.

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

  1. Front Matter

    Download chapter PDF

  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. Distributed Data Structures: A Survey on Informative Labeling Schemes

      • Cyril Gavoille
      Pages 38-38

    4. From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions

      • Herman Geuvers, Iris Loeb
      Pages 39-57

    5. The Structure of Tractable Constraint Satisfaction Problems

      • Martin Grohe
      Pages 58-72

    6. On the Representation of Kleene Algebras with Tests

      • Dexter Kozen
      Pages 73-83

    7. From Three Ideas in TCS to Three Applications in Bioinformatics

      • Ming Li
      Pages 84-85

  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. A Unified Construction of the Glushkov, Follow, and Antimirov Automata

      • Cyril Allauzen, Mehryar Mohri
      Pages 110-121

    4. Algebraic Characterizations of Unitary Linear Quantum Cellular Automata

      • Pablo Arrighi
      Pages 122-133

    5. A Polynomial Time Nilpotence Test for Galois Groups and Related Results

      • V. Arvind, Piyush P Kurur
      Pages 134-145

    6. The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems

      • Richard Beigel, William Gasarch, James Glenn
      Pages 146-156

    7. Crochemore Factorization of Sturmian and Other Infinite Words

      • Jean Berstel, Alessandra Savelli
      Pages 157-166

    8. Equations on Partial Words

      • F. Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis
      Pages 167-178

    9. Concrete Multiplicative Complexity of Symmetric Functions

      • Joan Boyar, René Peralta
      Pages 179-189

    10. On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures

      • Laurent Boyer, Victor Poupet, Guillaume Theyssier
      Pages 190-201

    11. Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities

      • Ulrik Brandes, Jürgen Lerner
      Pages 202-213

    12. The Kleene Equality for Graphs

      • Arnaud Carayol, Didier Caucal
      Pages 214-225
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2006

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation