000 06023nam a22006255i 4500
001 978-3-642-14162-1
003 DE-He213
005 20240730200237.0
007 cr nn 008mamaa
008 100705s2010 gw | s |||| 0|eng d
020 _a9783642141621
_9978-3-642-14162-1
024 7 _a10.1007/978-3-642-14162-1
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aAutomata, Languages and Programming
_h[electronic resource] :
_b37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II /
_cedited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXXIV, 614 p. 78 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 ;
_v6199
505 0 _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 Networksto 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.
650 0 _aComputer programming.
_94169
650 0 _aComputer networks .
_931572
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 1 4 _aProgramming Techniques.
_9162588
650 2 4 _aComputer Communication Networks.
_9162589
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aTheory of Computation.
_9162590
700 1 _aAbramsky, Samson.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9162591
700 1 _aGavoille, Cyril.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9162592
700 1 _aKirchner, Claude.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9162593
700 1 _aMeyer auf der Heide, Friedhelm.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9162594
700 1 _aSpirakis, Paul.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9162595
710 2 _aSpringerLink (Online service)
_9162596
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642141614
776 0 8 _iPrinted edition:
_z9783642141638
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6199
_9162597
856 4 0 _uhttps://doi.org/10.1007/978-3-642-14162-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95953
_d95953