Theoretical Computer Science 理论计算机科学

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 Talk 1
A LTS Semantics of Ambients via Graph Synchronization with Mobility
Lambda Calculus and Types
Filter Models and Easy Terms
Confluence of Untyped Lambda Calculus via Simple Types
Incremental Inference of Partial Types
Call-by-Value Separability and Computability
Algorithms and Data Structures Ⅰ
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
Job Shop Scheduling Problems with Controllable Processing Times
New Computing Paradigms
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 Set of Autonomous Mobile Robots
Formal Languages
Some Structural Properties of Associative Language Descriptions
Block-Deterministic Regular Languages
Constructing Finite Maximal Codes from Schiitzenberger Conjecture
Objects and Mobility
An Effective Translation of Fickle into Java(Extended Abstract)
Subtyping and Matching for Mobile Objects
On Synchronous and Asynchronous Communication Paradigms
Algorithms and Data Structures Ⅱ
Complexity of Layered Binary Search Trees with Relaxed Balance
Distance Constrained Labeling of Precolored Trees
Exponentially Decreasing Number of Operations in Balanced Trees
Invited Talk 2
Directed Hypergraphs(Problems, Algorithmic Results,and a Novel Decremental Approach
Computational Complexity
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
Relating Partial and Complete Solutions and the Complexity of Computing Solutions
Security
Logics and Logic Programming
Author Index