Foundations of Software Technology and Theoretical Computer Science : 19th Conference Chennai, India, December 13-15, 1999 Proceedings
This book constitutes the refereed proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'99, held in Chennai, India, in December 1999. The 30 revised full papers presented were carefully reviewed and selected from a total of 84 submissions. Also included are six invited contributions. The papers presented address all current issues in theoretical computer science and programming theory
eBook, English, 1999
Springer Berlin Heidelberg, Berlin, Heidelberg, 1999
1 online resource (XII, 452 pages)
9783540466918, 9783540668367, 3540466916, 3540668365
858924307
Print version:
Invited Talk 1
Recent Developments in the Theory of Arrangements of Surfaces
Session 1(a)
Dynamic Compressed Hyperoctrees with Application to the N-body Problem
Largest Empty Rectangle among a Point Set
Session 1(b)
Renaming Is Necessary in Timed Regular Expressions
Product Interval Automata: A Subclass of Timed Automata
Session 2(a)
The Complexity of Rebalancing a Binary Search Tree
Fast Allocation and Deallocation with an Improved Buddy System
Session 2(b)
Optimal Bounds for Transformations of?-Automata
CTL+ Is Exponentially More Succinct than CTL
Invited Talk 2
A Top-Down Look at a Secure Message
Session 3
Explaining Updates by Minimal Sums
A Foundation for Hybrid Knowledge Bases
Session 4
Hoare Logic for Mutual Recursion and Local Variables
Invited Talk 3
Explicit Substitutions and Programming Languages
Session 5(a)
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
A Randomized Algorithm for Flow Shop Scheduling
Session 5(b)
Synthesizing Distributed Transition Systems from Global Specifications
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
Session 6
Implicit Temporal Query Languages: Towards Completeness
On the Undecidability of Some Sub-classical First-Order Logics
Invited Talk 4
How to Compute with DNA
Session 7(a)
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Protecting Facets in Layered Manufacturing
Session 7(b)
The Receptive Distributed?-Calculus
Series and Parallel Operations on Pomsets
Session 8
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Invited Talk 5
Graph Isomorphism: Its Complexity and Algorithms
Session 9(a)
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables
Lower Bounds for Linear Transformed OBDDs and FBDDs
Session 9(b)
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems
Graded Modalities and Resource Bisimulation
Session 10(a)
The Non-recursive Power of Erroneous Computation
Analysis of Quantum Functions
Session 10(b)
On Sets Growing Continuously
Model Checking Knowledge and Time in Systems with Perfect Recall
FST & TCS
ISAAC Joint Session Talks
The Engineering of Some Bipartite Matching Programs
books.eclibrary.ca Access restricted to Harris Learning Library use, and to students, faculty, and staff of Nipissing University.