LEADER 05417nam 2200613 a 450 001 9910484309903321 005 20200520144314.0 010 $a1-280-38771-8 010 $a9786613565631 010 $a3-642-14162-5 024 7 $a10.1007/978-3-642-14162-1 035 $a(CKB)2670000000028923 035 $a(SSID)ssj0000446322 035 $a(PQKBManifestationID)11285475 035 $a(PQKBTitleCode)TC0000446322 035 $a(PQKBWorkID)10491046 035 $a(PQKB)10964615 035 $a(DE-He213)978-3-642-14162-1 035 $a(MiAaPQ)EBC3065483 035 $a(PPN)149072856 035 $a(EXLCZ)992670000000028923 100 $a20100830d2010 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, languages and programming $e37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part II /$fSamson Abramsky ... [et al.], (eds.) 205 $a1st ed. 2010. 210 $aBerlin $cSpringer$d2010 215 $a1 online resource (XXIV, 614 p. 78 illus.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6199 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14161-7 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham?s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern?Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. 410 0$aLecture notes in computer science ;$v6199. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aMachine theory$vCongresses 606 $aFormal languages$vCongresses 606 $aComputer programming$vCongresses 615 0$aMachine theory 615 0$aFormal languages 615 0$aComputer programming 676 $a005.11 701 $aAbramsky$b Samson$0732262 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484309903321 996 $aAutomata, languages and programming$94189694 997 $aUNINA