Overview

Full Product Details

Author:   Antonio Restivo ,  Simona Ronchi Della Rocca ,  Luca Roversi
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2001 ed.
Volume:   2202
Dimensions:   Width: 15.50cm , Height: 2.30cm , Length: 23.50cm
Weight:   1.410kg
ISBN:  

9783540426721

ISBN 10:   3540426728
Pages:   448
Publication Date:   21 September 2001
Audience:   Professional and scholarly ,  College/higher education ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Awaiting stock  
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Table of Contents

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 Schutzenberger 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions