000 04328nam a22005895i 4500
001 978-3-540-32024-1
003 DE-He213
005 20240423125846.0
007 cr nn 008mamaa
008 100317s2005 gw | s |||| 0|eng d
020 _a9783540320241
_9978-3-540-32024-1
024 7 _a10.1007/11560586
_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] :
_b9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings /
_cedited by Mario Coppo, Elena Lodi, G. Michele Pinna.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXI, 411 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3701
505 0 _aInvited Contributions -- Semantic Subtyping: Challenges, Perspectives, and Open Problems -- Biological Systems as Reactive Systems -- Mobile Agents Computing: Security Issues and Algorithmic Solutions -- Technical Contributions -- Efficient Algorithms for Detecting Regular Point Configurations -- Pickup and Delivery for Moving Objects on Broken Lines -- A Static Analysis of PKI-Based Systems -- Subtyping Object and Recursive Types Logically -- The Language ?: Circuits, Computations and Classical Logic -- Checking Risky Events Is Enough for Local Policies -- The Graph Rewriting Calculus: Confluence and Expressiveness -- Safe Object Composition in the Presence of Subtyping -- Reachability Analysis in Boxed Ambients -- Error Mining for Regular Expression Patterns -- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections -- Inapproximability Results for the Lateral Gene Transfer Problem -- Faster Deterministic Wakeup in Multiple Access Channels -- Weighted Coloring: Further Complexity and Approximability Results -- Quantum Algorithms for a Set of Group Theoretic Problems -- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs -- A Polymerase Based Algorithm for SAT -- Laxity Helps in Broadcast Scheduling -- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory -- Synthesis from Temporal Specifications Using Preferred Answer Set Programming -- Model Checking Strategic Abilities of Agents Under Incomplete Information -- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error -- A Theoretical Analysis of Alignment and Edit Problems for Trees -- A Complete Formulation of Generalized Affine Equivalence -- A New Combinatorial Approach to SequenceComparison -- A Typed Assembly Language for Non-interference -- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems -- A Typed Semantics of Higher-Order Store and Subtyping -- Two Variables Are Not Enough.
650 0 _aComputer science.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aTheory of Computation.
650 2 4 _aData Science.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aCoppo, Mario.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLodi, Elena.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPinna, G. Michele.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540291060
776 0 8 _iPrinted edition:
_z9783540816133
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3701
856 4 0 _uhttps://doi.org/10.1007/11560586
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182449
_d182449