rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Mathematical Foundations of Computer Science 2010
    sub title: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings
  name:
    name part: Hliněný, Petr.
    role:
      role term: editor.
  name:
    name part: Kučera, Antonín.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVII, 714 p. 71 illus. online resource.
  table of contents: New Developments in Quantum Algorithms -- Persistent Homology under Non-uniform Error -- Information Complexity of Online Problems -- Algorithmic Lower Bounds for Problems on Decomposable Graphs -- Do We Really Understand the Crossing Numbers? -- Balanced Queries: Divide and Conquer -- Slowly Synchronizing Automata and Digraphs -- Weights of Exact Threshold Functions -- Proof Systems and Transformation Games -- Scheduling Real-Time Mixed-Criticality Jobs -- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption -- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol -- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time -- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree -- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems -- Distance Constraint Satisfaction Problems -- Faster Algorithms on Branch and Clique Decompositions -- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks -- Robust Computations with Dynamical Systems -- On Factor Universality in Symbolic Spaces -- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity -- Resource Combinatory Algebras -- Randomness for Free -- Qualitative Analysis of Partially-Observable Markov Decision Processes -- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model -- Online Clustering with Variable Sized Clusters -- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains -- Counting Classes and the Fine Structure between NC 1 and L -- The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn) -- Connected Searching of Weighted Trees -- Iterated Regret Minimization in Game Graphs -- Properties of Visibly Pushdown Transducers -- Second-Order Algebraic Theories -- Frame Definability for Classes of Trees in the ?-calculus -- Evaluating Non-…
  note: edited by Petr Hliněný, Antonín Kučera.
  subject:
    topic: Computer science
  subject:
    topic: Computer programming
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Programming Techniques
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Theory of Computation
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computation by Abstract Devices
  classification: QA76.6-76.66
  classification: 005.11
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 6281
  identifier: 9783642151552
  identifier: http://dx.doi.org/10.1007/978-3-642-15155-2
  record info:
    record creation date: 100814
    record change date: 20151204164855.0
    record identifier: 978-3-642-15155-2