Cantitate/Preț
Produs
Total produse
Vezi coșul
Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings de Josep Diaz

Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings: Lecture Notes in Computer Science, cartea 8705

Editat de Josep Diaz, Ivan Lanese, Davide Sangiorgi
en Limba Engleză Paperback – aug 2014
This 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
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32944 lei

Preț vechi: 41180 lei
-20% Nou

Puncte Express: 494
Preț estimativ în valută:
6305€ • 6549$ • 5237£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662446010
ISBN-10: 3662446014
Pagini: 372
Ilustrații: XVI, 355 p. 57 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.52 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Zero-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.

Textul de pe ultima copertă

This 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