LEADER 06687nam 22008415 450 001 9910484021803321 005 20251113190056.0 010 $a3-662-43951-4 024 7 $a10.1007/978-3-662-43951-7 035 $a(CKB)3710000000143974 035 $a(SSID)ssj0001274727 035 $a(PQKBManifestationID)11739382 035 $a(PQKBTitleCode)TC0001274727 035 $a(PQKBWorkID)11333430 035 $a(PQKB)11659475 035 $a(DE-He213)978-3-662-43951-7 035 $a(MiAaPQ)EBC3107014 035 $a(PPN)179766554 035 $a(EXLCZ)993710000000143974 100 $a20140611d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages, and Programming $e41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II /$fedited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias 205 $a1st ed. 2014. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014. 215 $a1 online resource (XXX, 624 p. 49 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8573 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-662-43950-6 327 $aTrack 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8573 606 $aAlgorithms 606 $aComputer science 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aApplication software 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aTheory of Computation 606 $aComputer Communication Networks 606 $aInformation Storage and Retrieval 606 $aComputer and Information Systems Applications 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aComputer networks. 615 0$aInformation storage and retrieval systems. 615 0$aApplication software. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aInformation Storage and Retrieval. 615 24$aComputer and Information Systems Applications. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.13 702 $aEsparza$b Javier$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFraigniaud$b Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHusfeldt$b Thore$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKoutsoupias$b Elias$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484021803321 996 $aAutomata, languages and programming$9339738 997 $aUNINA