| The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.) |
| Invited 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 Rieeursive Types Logically The Language X: Circuits, Computations and Classical Logic Checking Risky Events Is Enough tor Local Policies The Graph Rewriting Calculus: Confluence and Expressiveness Safe Object Composition in the Presence of Sutyping Reachability Analysis in Boxed Ambients Error Mining for Regular Expression Patterns Reconstructing an Alternate Periodical Binary Matrlx from Its Orthogonal Projections Inapproximabillty Results for the Lateral Oene Transfer Problem Faster Deterministic Vgakeup in Multiple Access Channels Wclghted Coloring: Parther Complexity and Approximability Results Quantmn Algorithms h)r 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, CommutativiD; Totality, and Strong iNordivert b ty for One-Way Function8 in Complexity Theory Synthesis from Temporal Specifications Using Preferred Answer Set Programlning Model Checking Strategic Abilities of Agents Under Incomplete Information Improved Algorithms for Polynomial-Time Decay and Time Decay with Additive Error …… Author Index |
内容加载中，请稍后...
商品评论（0条）