Skip to main content
  • Conference proceedings
  • © 2010

Mathematical Foundations of Computer Science 2010

35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings

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

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

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

  1. Front Matter

  2. New Developments in Quantum Algorithms

    • Andris Ambainis
    Pages 1-11
  3. Persistent Homology under Non-uniform Error

    • Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit Patel
    Pages 12-23
  4. Information Complexity of Online Problems

    • Juraj Hromkovič, Rastislav Královič, Richard Královič
    Pages 24-36
  5. Balanced Queries: Divide and Conquer

    • Dmitri Akatov, Georg Gottlob
    Pages 42-54
  6. Slowly Synchronizing Automata and Digraphs

    • Dmitry Ananichev, Vladimir Gusev, Mikhail Volkov
    Pages 55-65
  7. Weights of Exact Threshold Functions

    • László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun
    Pages 66-77
  8. Proof Systems and Transformation Games

    • Yoram Bachrach, Michael Zuckerman, Michael Wooldridge, Jeffrey S. Rosenschein
    Pages 78-89
  9. Scheduling Real-Time Mixed-Criticality Jobs

    • Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow et al.
    Pages 90-101
  10. A dexptime-Complete Dolev-Yao Theory with Distributive Encryption

    • A. Baskar, R. Ramanujam, S. P. Suresh
    Pages 102-113
  11. Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time

    • Ivona Bezáková, Adam J. Friedlander
    Pages 126-137
  12. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

    • Davide Bilò, Luciano Gualà, Guido Proietti
    Pages 138-149
  13. Distance Constraint Satisfaction Problems

    • Manuel Bodirsky, Victor Dalmau, Barnaby Martin, Michael Pinsker
    Pages 162-173
  14. Faster Algorithms on Branch and Clique Decompositions

    • Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
    Pages 174-185
  15. Robust Computations with Dynamical Systems

    • Olivier Bournez, Daniel S. Graça, Emmanuel Hainry
    Pages 198-208

Other Volumes

  1. Mathematical Foundations of Computer Science 2010

Editors and Affiliations

  • Falculty of Informatics, Masaryk University, Brno, Czech Republic

    Petr Hliněný

  • Faculty of Informatics, Masaryk University, Brno, Czech Republic

    Antonín Kučera

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