Del i serien Lecture Notes in Computer Science

Automata, Languages, and Programming

42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II

Häftad, Engelska, 2015

AvMagnús M. Halldórsson,Kazuo Iwama,Naoki Kobayashi,Bettina Speckmann

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The papers are organized in the following three tracks: algorithms, complexity, and games;

Produktinformation

Utgivningsdatum2015-07-01
Mått155 x 235 x 41 mm
Vikt1 130 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor717
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662476659

Tillhör följande kategorier

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.