Proceedings of the 10th Italian Conference on Theoretical Computer Science, ICTS'07: Rome, Italy, 3-5 October 2007
Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. The subjects of this book range from logical and mathematical aspects of computing, design and analysis of algorithms, to semantics of programming languages. Sample Chapter(s). Part A: Invited Talks: Clairvoyance and Laziness for on Line Travelling Agents (27 KB). Contents: Clairvoyance and Laziness for on Line Travelling Agents (G Ausiello); Symmetries in Foundations (G Longo); On the Approximability of Dense Steiner Tree Problems (M Hauptmann); Analyzing Non-Inteference with Respect to Classes (D Zanardini); Modeling Fuzzy Behaviours in Concurrent Systems (L D''Errico & M Loreti); Sorting Streamed Multisets (T Gagie); Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems (S Kosub & C M Homan); Definable Sets in Weak Presburger Arithmetic (C Choffrut & A Frigeri); and other papers. Readership: Theoretical computer scientists.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract action algorithm approximation scheme assumption bisimulation boolean functions bounded BPK model colors complexity compositional compilation Computer Science concurrent condition connected components consider constraints deﬁned deﬁnition denote dynamical systems edge efﬁcient entailment relation extended Markovian ﬁelds ﬁnd ﬁnite ﬁrst ﬁxed point ﬂow formula Fuzzy graph G hence input instance Java L-Fuzzy Sets label(u labeled languages left-marked Lemma Markovian bisimilarity Markovian process method MIN-CC problem motif multiset notion NP-complete occurrence parameterized Parameterized Complexity partition node permutation phylogenetic network planar graphs polymorphic polynomial Presburger arithmetic principal typings process calculi process terms proofs of knowledge properties protocol prove PTAS recursive resp result satisﬁed Section sound and complete speciﬁc splay-tree Steiner Tree Problem strings subset target graph terminal set Theorem 3.1 type inference type system unobservable variables veriﬁer vertex vertices witness extraction Z-simple zero-knowledge