000 04798nam a22006375i 4500
001 978-3-662-44602-7
003 DE-He213
005 20240423125605.0
007 cr nn 008mamaa
008 140823s2014 gw | s |||| 0|eng d
020 _a9783662446027
_9978-3-662-44602-7
024 7 _a10.1007/978-3-662-44602-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheoretical Computer Science
_h[electronic resource] :
_b8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings /
_cedited by Josep Diaz, Ivan Lanese, Davide Sangiorgi.
250 _a1st ed. 2014.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXVI, 355 p. 57 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 ;
_v8705
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 1 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
700 1 _aDiaz, Josep.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLanese, Ivan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSangiorgi, Davide.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662446010
776 0 8 _iPrinted edition:
_z9783662446034
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8705
856 4 0 _uhttps://doi.org/10.1007/978-3-662-44602-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c179621
_d179621