04144nam 2200637Ia 450 991082223100332120200520144314.01-281-91164-X9786611911645981-277-099-2(CKB)1000000000413577(SSID)ssj0000378394(PQKBManifestationID)12127129(PQKBTitleCode)TC0000378394(PQKBWorkID)10366910(PQKB)11549363(MiAaPQ)EBC1679801(WSP)00006581(Au-PeEL)EBL1679801(CaPaEBR)ebr10255735(CaONFJC)MIL191164(OCoLC)879024142(EXLCZ)99100000000041357720071006d2007 uy 0engurcn|||||||||txtccrProceedings of the 10th Italian Conference on Theoretical Computer Science, ICTS'07 Rome, Italy, 3-5 October 2007 /editors, Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura1st ed.Singapore ;Hackensack, NJ World Scientificc2007xiii, 199 p. illBibliographic Level Mode of Issuance: Monograph981-277-098-4 Includes bibliographical references and index.pt. A. Invited talks. Clairvoyance and laziness for on line travelling agents / G. Ausiello. Proving the range property for Lambda theories and models / H. Barendregt. Can a proper Lambda-model have an R.E. equational theory? / C. Berline. Session centered calculi for service oriented computing / R. De Nicola. Symmetries in foundations / G. Longo -- pt. B. Regular contributions. On the approximability of dense Steiner tree problems / M. Hauptmann. Weak pattern matching in colored graphs: minimizing the number of connected components / R. Dondi, G. Fertin, and S. Vialette. Weak Markovian bisimilarity: abstracting from prioritized/weighted internal immediate actions / M. Bernardo and A. Aldini. Analyzing non-interference with respect to classes / D. Zanardini. Computing minimum directed feedback vertex set in O+(1.9977n) / I. Razgon. Seeing the trees and their branches in the network is hard / I.A. Kanj ... [et al.]. Modeling fuzzy behaviours in concurrent systems / L. D'Errico and M. Loreti. A formal framework for compositional compilation / D. Ancona and E. Zucca. Type inference for polymorphic mehods in Java-like languages / D. Ancona, G. Lagorio and E. Zucca. Sorting streamed multisets / T. Gagie. An analysis of a simple algorithm for random derangements / D. Merlini, R. Sprugnoli, and M. C. Verri. The measure hypothesis and efficiency of polynomial time approximation schemes / M. Hauptmann. Dichotomy results for fixed point counting in boolean dynamical systems / S. Kosub and C. M. Homan. Definable sets in weak Presburger arithmetic / C. Choffrut and A. Frigeri. On definite proofs of knowledge in the bare public-key model / G. Di Crescenzo and I. Visconti."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."Theoretical computer scienceICTS'07Computer scienceCongressesComputersCongressesComputer scienceComputers004Italiano Giuseppe F301042Moggi Eugenio1622514Laura Luigi893367Italian Conference on Theoretical Computer ScienceMiAaPQMiAaPQMiAaPQBOOK9910822231003321Proceedings of the 10th Italian Conference on Theoretical Computer Science, ICTS'073956410UNINA