LEADER 05270nam 22008415 450 001 9910484599703321 005 20251106125534.0 010 $a3-662-44602-2 024 7 $a10.1007/978-3-662-44602-7 035 $a(CKB)3710000000227451 035 $a(SSID)ssj0001338869 035 $a(PQKBManifestationID)11746244 035 $a(PQKBTitleCode)TC0001338869 035 $a(PQKBWorkID)11345120 035 $a(PQKB)10098534 035 $a(DE-He213)978-3-662-44602-7 035 $a(MiAaPQ)EBC6284633 035 $a(MiAaPQ)EBC5610310 035 $a(Au-PeEL)EBL5610310 035 $a(OCoLC)889877741 035 $a(PPN)180626248 035 $a(EXLCZ)993710000000227451 100 $a20140823d2014 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheoretical Computer Science $e8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings /$fedited by Josep Diaz, Ivan Lanese, Davide Sangiorgi 205 $a1st ed. 2014. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014. 215 $a1 online resource (XVI, 355 p. 57 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8705 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-662-44601-4 327 $aZero-Suppressed Binary Decision Diagrams Resilient to Index Faults -- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs -- Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks -- The Shortest Path Game: Complexity and Algorithms -- Online Scheduling of Unit Length Jobs with Commitment and Penalties -- The Lazy Matroid Problem -- Treewidth Computation and Kernelization in the Parallel External Memory Model -- Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic -- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions -- Subshifts, MSO Logic, and Collapsing Hierarchies -- Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds? Algorithm -- Not All Multi-valued Partial CFL Functions Are Refined by Single-Valued Functions -- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus -- A Hoare-Like Calculus Using the SROIQ? Logic on Transformations of Graphs -- Termination Analysis for Graph Transformation Systems -- Tropical Two-Way Automata -- Parametric LTL on Markov Chains -- Specifying and Verifying Properties of Space -- Primal Infon Logic with Conjunctions as Sets -- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic -- Towards a Coalgebraic Chomsky Hierarchy (Extended Abstract) -- Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics -- Quantitative Types for the Linear Substitution Calculus -- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata -- Looking at Separation Algebras with Boolean BI-eyes -- The Inhabitation Problem for Non-idempotent Intersection Types. 330 $aThis book constitutes the refereed proceedings of the 8th FIP WG 2.2 International Conference, TCS 2014, held in Rome, Italy, in September 2014. The 26 revised full papers presented, together with two invited talks, were carefully reviewed and selected from 73 submissions. [Suggestion--please check and add more if needed] TCS-2014 consisted of two tracks, with separate program committees, which dealt respectively with: - Track A: Algorithms, Complexity and Models of Computation, and - Track B: Logic, Semantics, Specification and Verification. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8705 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 676 $a004 702 $aDiaz$b Josep$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLanese$b Ivan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSangiorgi$b Davide$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484599703321 996 $aTheoretical computer science$9104541 997 $aUNINA