Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2007

Mathematical Foundations of Computer Science 2007

32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings

Editors:

  1. Luděk Kučera
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Antonín Kučera
    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 4708)

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 2007.

Sections

Buy it now

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

  1. Front Matter

    PDF

  2. Invited Papers

    1. How To Be Fickle

      • Vašek Chvátal
      Pages 1-1

    5. Evolvability

      • Leslie G. Valiant
      Pages 22-43

  3. Random Graphs

    1. Expander Properties and the Cover Time of Random Intersection Graphs

      • Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
      Pages 44-55

  4. Rewriting

    1. Transition Graphs of Rewriting Systems over Unranked Trees

      • Christof Löding, Alex Spelten
      Pages 67-77

  5. Approximation Algorithms

    2. New Approximability Results for 2-Dimensional Packing Problems

      • Klaus Jansen, Roberto Solis-Oba
      Pages 103-114

    3. On Approximation of Bookmark Assignments

      • Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
      Pages 115-124

  6. Automata and Circuits

    1. Height-Deterministic Pushdown Automata

      • Dirk Nowotka, Jiří Srba
      Pages 125-134

    2. Minimizing Variants of Visibly Pushdown Automata

      • Patrick Chervet, Igor Walukiewicz
      Pages 135-146

    3. Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids

      • Christoph Behle, Andreas Krebs, Mark Mercer
      Pages 147-158

  7. Complexity I

    2. NP by Means of Lifts and Shadows

      • Gábor Kun, Jaroslav Nešetřil
      Pages 171-181

    3. The Complexity of Solitaire

      • Luc Longpré, Pierre McKenzie
      Pages 182-193

  8. Streams and Compression

    1. Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems

      • Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
      Pages 194-205
Back to top

Other Volumes

  1. Mathematical Foundations of Computer Science 2007

Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation