Foundations of Software Technology and Theoretical Computer Science: 19th Conference Chennai, India, December 13-15, 1999 Proceedings
Author: C. Pandu Rangan, V. Raman, R. Ramanujam
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66836-7
DOI: 10.1007/3-540-46691-6

Table of Contents:

• Recent Developments in the Theory of Arrangements of Surfaces
  
• Dynamic Compressed Hyperoctrees with Application to the N-body Problem
  
• Largest Empty Rectangle among a Point Set
  
• Renaming Is Necessary in Timed Regular Expressions
  
• Product Interval Automata: A Subclass of Timed Automata
  
• The Complexity of Rebalancing a Binary Search Tree
  
• Fast Allocation and Deallocation with an Improved Buddy System
  
• Optimal Bounds for Transformations of ω-Automata
  
• CTL+ Is Exponentially More Succinct than CTL
  
• A Top-Down Look at a Secure Message
  
• Explaining Updates by Minimal Sums
  
• A Foundation for Hybrid Knowledge Bases
  
• Hoare Logic for Mutual Recursion and Local Variables
  
• Explicit Substitutions and Programming Languages
  
• Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
  
• A Randomized Algorithm for Flow Shop Scheduling
  
• Synthesizing Distributed Transition Systems from Global Specifications
  
• Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
  
• Implicit Temporal Query Languages: Towards Completeness
  
• On the Undecidability of Some Sub-classical First-Order Logics