LEADER 06785nam 22008415 450 001 996216374503316 005 20230329132007.0 010 $a3-662-47666-5 024 7 $a10.1007/978-3-662-47666-6 035 $a(CKB)3710000000437004 035 $a(SSID)ssj0001558443 035 $a(PQKBManifestationID)16183964 035 $a(PQKBTitleCode)TC0001558443 035 $a(PQKBWorkID)14819398 035 $a(PQKB)10211502 035 $a(DE-He213)978-3-662-47666-6 035 $a(MiAaPQ)EBC5596183 035 $a(PPN)186399707 035 $a(EXLCZ)993710000000437004 100 $a20150619d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages, and Programming$b[electronic resource] $e42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /$fedited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann 205 $a1st ed. 2015. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2015. 215 $a1 online resource (XXXIX, 717 p. 65 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9135 300 $aIncludes index. 311 $a3-662-47665-7 327 $aTowards 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 Have Independent 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. 330 $aThe 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 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata and theory of programming; and foundations of networked computation: models, algorithms and information management. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9135 606 $aAlgorithms 606 $aComputer science 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aApplication software 606 $aComputer science?Mathematics 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?Mathematics. 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.1 702 $aHalldórsson$b Magnús M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aIwama$b Kazuo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKobayashi$b Naoki$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSpeckmann$b Bettina$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996216374503316 996 $aAutomata, languages and programming$9339738 997 $aUNISA