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. On Factor Universality in Symbolic Spaces

    • Laurent Boyer, Guillaume Theyssier
    Pages 209-220
  2. Resource Combinatory Algebras

    • Alberto Carraro, Thomas Ehrhard, Antonino Salibra
    Pages 233-245
  3. Randomness for Free

    • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger
    Pages 246-257
  4. Qualitative Analysis of Partially-Observable Markov Decision Processes

    • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
    Pages 258-269
  5. All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model

    • Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
    Pages 270-281
  6. Online Clustering with Variable Sized Clusters

    • János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
    Pages 282-293
  7. Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains

    • Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
    Pages 294-305
  8. Counting Classes and the Fine Structure between NC 1 and L

    • Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
    Pages 306-317
  9. Connected Searching of Weighted Trees

    • Dariusz Dereniowski
    Pages 330-341
  10. Iterated Regret Minimization in Game Graphs

    • Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin
    Pages 342-354
  11. Properties of Visibly Pushdown Transducers

    • Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
    Pages 355-367
  12. Second-Order Algebraic Theories

    • Marcelo Fiore, Ola Mahmoud
    Pages 368-380
  13. Frame Definability for Classes of Trees in the μ-calculus

    • Gaëlle Fontaine, Thomas Place
    Pages 381-392
  14. Finding and Counting Vertex-Colored Subtrees

    • Sylvain Guillemot, Florian Sikora
    Pages 405-416
  15. Limiting Negations in Bounded Treewidth and Upward Planar Circuits

    • Jing He, Hongyu Liang, Jayalal M. N. Sarma
    Pages 417-428
  16. On the Topological Complexity of MSO+U and Related Automata Models

    • Szczepan Hummel, Michał Skrzypczak, Szymon Toruńczyk
    Pages 429-440
  17. Least and Greatest Solutions of Equations over Sets of Integers

    • Artur Jeż, Alexander Okhotin
    Pages 441-452

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