000 04507nam a22006135i 4500
001 978-3-540-45446-5
003 DE-He213
005 20240423132513.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540454465
_9978-3-540-45446-5
024 7 _a10.1007/3-540-45446-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheoretical Computer Science
_h[electronic resource] :
_b7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings /
_cedited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aXII, 448 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2202
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 0 _aArtificial intelligence
_xData processing.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aData Science.
700 1 _aRestivo, Antonio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRonchi Della Rocca, Simona.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRoversi, Luca.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540426721
776 0 8 _iPrinted edition:
_z9783662198278
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2202
856 4 0 _uhttps://doi.org/10.1007/3-540-45446-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188479
_d188479