000 06379nam a22006615i 4500
001 978-3-662-43951-7
003 DE-He213
005 20240730192658.0
007 cr nn 008mamaa
008 140611s2014 gw | s |||| 0|eng d
020 _a9783662439517
_9978-3-662-43951-7
024 7 _a10.1007/978-3-662-43951-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aAutomata, Languages, and Programming
_h[electronic resource] :
_b41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II /
_cedited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias.
250 _a1st ed. 2014.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXXX, 624 p. 49 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8573
505 0 _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.
520 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 0 _aComputer networks .
_931572
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aApplication software.
_9150880
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_9150881
650 2 4 _aComputer Communication Networks.
_9150882
650 2 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aComputer and Information Systems Applications.
_9150883
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aEsparza, Javier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150884
700 1 _aFraigniaud, Pierre.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150885
700 1 _aHusfeldt, Thore.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150886
700 1 _aKoutsoupias, Elias.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150887
710 2 _aSpringerLink (Online service)
_9150888
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662439500
776 0 8 _iPrinted edition:
_z9783662439524
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8573
_9150889
856 4 0 _uhttps://doi.org/10.1007/978-3-662-43951-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94378
_d94378