國立虎尾科技大學 |

Automata, Languages, and Programming = 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Automata, Languages, and Programming/ edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann.
其他題名:	42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /
其他作者:	Halldórsson, Magnús M.
面頁冊數:	XXXIX, 717 p. 65 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-662-47666-6
ISBN:	9783662476666

Automata, Languages, and Programming = 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /
Automata, Languages, and Programming42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /[electronic resource] :edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann. - 1st ed. 2015. - XXXIX, 717 p. 65 illus.online resource. - Theoretical Computer Science and General Issues ;9135. - Theoretical Computer Science and General Issues ;9163.

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 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.

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 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.

ISBN: 9783662476666

Standard No.: 10.1007/978-3-662-47666-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Automata, Languages, and Programming = 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II /
LDR:05223nam a22004095i 4500 001 970277
003 DE-He213
005 20200725164844.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783662476666 $9 978-3-662-47666-6
024 7 $a 10.1007/978-3-662-47666-6 $2 doi
035 $a 978-3-662-47666-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Automata, Languages, and Programming $h [electronic resource] : $b 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II / $c edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann.
250 $a 1st ed. 2015.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a XXXIX, 717 p. 65 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9135
505 0 $a 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 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.
520 $a 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 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computers. $3 565115
650 0 $a Computer communication systems. $3 1115394
650 0 $a Information storage and retrieval. $3 1069252
650 0 $a Application software. $3 528147
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Information Storage and Retrieval. $3 593926
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
700 1 $a Halldórsson, Magnús M. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1265767
700 1 $a Iwama, Kazuo. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1074168
700 1 $a Kobayashi, Naoki. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1265768
700 1 $a Speckmann, Bettina. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 889241
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662476673
776 0 8 $i Printed edition: $z 9783662476659
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-662-47666-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)