|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-14162-1 |
003 |
DE-He213 |
005 |
20230221150307.0 |
007 |
cr nn 008mamaa |
008 |
100705s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642141621
|9 978-3-642-14162-1
|
024 |
7 |
|
|a 10.1007/978-3-642-14162-1
|2 doi
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Automata, Languages and Programming
|h [electronic resource] :
|b 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II /
|c edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis.
|
250 |
|
|
|a 1st ed. 2010.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
300 |
|
|
|a XXIV, 614 p. 78 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,
|x 2512-2029 ;
|v 6199
|
505 |
0 |
|
|a Invited 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.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Computer networks .
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science.
|
650 |
1 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Theory of Computation.
|
700 |
1 |
|
|a Abramsky, Samson.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Gavoille, Cyril.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Kirchner, Claude.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Meyer auf der Heide, Friedhelm.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Spirakis, Paul.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642141614
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642141638
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6199
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-14162-1
|z Texto Completo
|
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)
|