Overview

Full Product Details

Author:   Magnús M. Halldórsson ,  Kazuo Iwama ,  Naoki Kobayashi ,  Bettina Speckmann
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2015 ed.
Volume:   9135
Dimensions:   Width: 15.50cm , Height: 3.80cm , Length: 23.50cm
Weight:   1.145kg
ISBN:  

9783662476659

ISBN 10:   3662476657
Pages:   717
Publication Date:   01 July 2015
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Towards the Graph Minor Theorems for Directed Graphs.- Automated Synthesis of Distributed Controllers.- Games for Dependent Types.- Short Proofs of the Kneser-Lovász Coloring Principle.- Provenance Circuits for Trees and Treelike Instances.- Language Emptiness of Continuous-Time Parametric Timed Automata.- Analysis of Probabilistic Systems via Generating Functions and Padé Approximation.- On Reducing Linearizability to State Reachability.- The Complexity of Synthesis from Probabilistic Components.- Edit Distance for Pushdown Automata.- Solution Sets for Equations over Free Groups Are EDT0L Languages.- Limited Set Quantifiers over Countable Linear Orderings.- Reachability Is in DynFO.- Natural Homology.- Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes.- Trading Bounds for Memory in Games with Counters.- Decision Problems of Tree Transducers with Origin.- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words.- The Odds of Staying on Budget.- From Sequential Specifications to Eventual Consistency.- Fixed-Dimensional Energy Games Are in Pseudo-Polynomial Time.- An Algebraic Geometric Approach to Nivat’s Conjecture.- Nominal Kleene Coalgebra.- On Determinisation of Good-for-Games Automata.- Owicki-Gries Reasoning for Weak Memory Models.- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.- Compressed Tree Canonization.- Parsimonious Types and Non-uniform Computation.- Baire Category Quantifier in Monadic Second Order Logic.- Liveness of Parameterized Timed Networks.- Symmetric Strategy Improvement.- Effect Algebras, Presheaves, Non-locality and Contextuality.- On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.- Containment of Monadic Datalog Programs via Bounded Clique-Width.- An Approach to Computing Downward Closures.- How Much Lookahead Is Needed to Win Infinite Games?.- Symmetric Graph Properties HaveIndependent Edges.- Polylogarithmic-Time Leader Election in Population Protocols.- Core Size and Densification in Preferential Attachment Networks.- Maintaining Near-Popular Matchings.- Ultra-Fast Load Balancing on Scale-Free Networks.- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms.- The Range of Topological Effects on Communication.- Secretary Markets with Local Information.- A Simple and Optimal Ancestry Labeling Scheme for Trees.- Interactive Communication with Unknown Noise Rate.- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs.- A Unified Framework for Strong Price of Anarchy in Clustering Games.- On the Diameter of Hyperbolic Random Graphs.- Tight Bounds for Cost-Sharing in Weighted Congestion Games.- Distributed Broadcast Revisited: Towards Universal Optimality.- Selling Two Goods Optimally.- Adaptively Secure Coin-Flipping, Revisited.- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem.- Normalization Phenomena in Asynchronous Networks.- Broadcast from Minicast Secure Against General Adversaries.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions