Del i serien Lecture Notes in Computer Science

Automata, Languages, and Programming

41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II

Häftad, Engelska, 2014

AvJavier Esparza,Pierre Fraigniaud,Thore Husfeldt,Elias Koutsoupias

729 kr

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

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

Produktinformation

Utgivningsdatum2014-06-23
Mått155 x 235 x 36 mm
Vikt978 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor624
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662439500

Tillhör följande kategorier

Track B: Logic, Semantics, Automata, and Theory of Programming.- Symmetric Groups and Quotient Complexity of Boolean Operations.- Handling Infinitely Branching WSTS.- Transducers with Origin Information.- Weak MSO+U with Path Quantifiers over Infinite Trees.- On the Decidability of MSO+U on Infinite Trees.- A Coalgebraic Foundation for Coinductive Union Types.- Turing Degrees of Limit Sets of Cellular Automata.- On the Complexity of Temporal-Logic Path Checking.- Parameterised Linearisability.- Games with a Weak Adversary.- The Complexity of Ergodic Mean-payoff Games.- Toward a Structure Theory of Regular Infinitary Trace Languages.- Unary Pushdown Automata and Straight-Line Programs.- Robustness against Power is PSpace-complete.- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic.- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs.- Coalgebraic Weak Bisimulation from Recursive Equations over Monads.- Piecewise Boolean Algebras and Their Domains.- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency.- Bisimulation Equivalence of First-Order Grammars.- Context Unification is in PSPACE.- Monodic Fragments of Probabilistic First-Order Logic.- Stability and Complexity of Minimising Probabilistic Automata.- Kleene Algebra with Equations.- All–Instances Termination of Chase is Undecidable.- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus.- On the Positivity Problem for Simple Linear Recurrence Sequences.- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences.- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.- Hardness Results for Intersection Non-Emptiness.- Branching Bisimilarity Checking for PRS.- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs.- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints.- Distributed Computing on Core-Periphery Networks:Axiom-Based Design 399.- Fault-Tolerant Rendezvous in Networks.- Data Delivery by Energy-Constrained Mobile Agents on a Line.- The Power of Two Choices in Distributed Voting.- Jamming-Resistant Learning in Wireless Networks.- Facility Location in Evolving Metrics.- Solving the ANTS Problem with Asynchronous Finite State Machines.- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set.- Randomized Rumor Spreading in Dynamic Graphs.- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods.- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems.- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds.- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router.- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud.- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems.- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners.