LEADER 05381nam 22007575 450 001 996465783203316 005 20200705080914.0 010 $a3-540-45446-2 024 7 $a10.1007/3-540-45446-2 035 $a(CKB)1000000000211599 035 $a(SSID)ssj0000327184 035 $a(PQKBManifestationID)11230845 035 $a(PQKBTitleCode)TC0000327184 035 $a(PQKBWorkID)10301502 035 $a(PQKB)10483023 035 $a(DE-He213)978-3-540-45446-5 035 $a(MiAaPQ)EBC3073047 035 $a(PPN)155218034 035 $a(EXLCZ)991000000000211599 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheoretical Computer Science$b[electronic resource] $e7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings /$fedited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 448 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2202 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42672-8 320 $aIncludes bibliographical references and index. 327 $aA LTS Semantics of Ambients via Graph Synchronization with Mobility -- Filter Models and Easy Terms -- Confluence of Untyped Lambda Calculus via Simple Types -- Incremental Inference of Partial Types -- Call-by-Value Separability and Computability -- Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms -- Job Shop Scheduling Problems with Controllable Processing Times -- Upper Bounds on the Size of One-Way Quantum Finite Automata -- P Systems with Gemmation of Mobile Membranes -- Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots -- Some Structural Properties of Associative Language Descriptions -- Block-Deterministic Regular Languages -- Constructing Finite Maximal Codes from Schützenberger Conjecture -- An Effective Translation of Fickle into Java -- Subtyping and Matching for Mobile Objects -- On Synchronous and Asynchronous Communication Paradigms -- Complexity of Layered Binary Search Trees with Relaxed Balance -- Distance Constrained Labeling of Precolored Trees -- Exponentially Decreasing Number of Operations in Balanced Trees -- Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach -- Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold -- Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions -- On the Distribution of a Key Distribution Center -- Online Advertising: Secure E-coupons -- A Calculus and Complexity Bound for Minimal Conditional Logic -- Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach -- E-unifiability via Narrowing. 330 $aThis book constitutes the refereed proceedings of the 7th Italian Conference on Theoretical Computer Science, ICTCS 2001, held in Torino, Italy in October 2001. The 25 revised full papers presented together with two invited papers were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on lambda calculus and types, algorithms and data structures, new computing paradigms, formal languages, objects and mobility, computational complexitiy, security, and logics and logic programming. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2202 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aData structures (Computer science) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aData structures (Computer science). 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aData Structures. 676 $a004.0151 702 $aRestivo$b Antonio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRonchi Della Rocca$b Simona$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRoversi$b Luca$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465783203316 996 $aTheoretical computer science$9104541 997 $aUNISA