Theoretical Computer Science
Springer Berlin (Verlag)
978-3-540-42672-1 (ISBN)
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.
A 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.
| Erscheint lt. Verlag | 21.9.2001 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 448 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 640 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmics • algorithms • Complexity • data structure • data structures • Discrete Mathematics • formal language • formal methods • Foundations • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Lambda Calculus • Logic • Logical Foundations • Mathematical Logic • programming • Programming Theory • Program Semantics • theoretical computer science • Theory of Computation |
| ISBN-10 | 3-540-42672-8 / 3540426728 |
| ISBN-13 | 978-3-540-42672-1 / 9783540426721 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
