LEADER 04078nam  2200601Ia 450 
001 9910777322203321
005 20230124182426.0
010   $a1-281-91164-X
010   $a9786611911645
010   $a981-277-099-2
035   $a(CKB)1000000000413577
035   $a(SSID)ssj0000378394
035   $a(PQKBManifestationID)12127129
035   $a(PQKBTitleCode)TC0000378394
035   $a(PQKBWorkID)10366910
035   $a(PQKB)11549363
035   $a(MiAaPQ)EBC1679801
035   $a(WSP)00006581
035   $a(Au-PeEL)EBL1679801
035   $a(CaPaEBR)ebr10255735
035   $a(CaONFJC)MIL191164
035   $a(OCoLC)879024142
035   $a(EXLCZ)991000000000413577
100   $a20071006d2007      uy             0
101 0 $aeng
135   $aurcn|||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aProceedings of the 10th Italian Conference on Theoretical Computer Science, ICTS'07$b[electronic resource] $eRome, Italy, 3-5 October 2007 /$feditors, Giuseppe F. Italiano, Eugenio Moggi, Luigi Laura
210   $aSingapore ;$aHackensack, NJ $cWorld Scientific$dc2007
215   $axiii, 199 p. $cill
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a981-277-098-4 
320   $aIncludes bibliographical references and index.
327   $apt. 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.
330   $a"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."
606   $aComputer science$vCongresses
606   $aComputers$vCongresses
615  0$aComputer science
615  0$aComputers
676   $a004
701   $aItaliano$b Giuseppe F$0301042
701   $aMoggi$b Eugenio$01573954
701   $aLaura$b Luigi$0893367
712 12$aItalian Conference on Theoretical Computer Science
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910777322203321
996   $aProceedings of the 10th Italian Conference on Theoretical Computer Science, ICTS'07$93849903
997   $aUNINA