Foundations of Software Technology and Theoretical Computer Science

de C. Pandu Rangan, R. Ramanujam

Foundations of Software Technology and Theoretical Computer Science: 19th Conference Chennai, India, December 13-15, 1999 Proceedings<br />Author: C. Pandu Rangan, V. Raman, R. Ramanujam<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-66836-7<br /> DOI: 10.1007/3-540-46691-6<br /><br />Table of Contents:<p></p><ul><li>Recent Developments in the Theory of Arrangements of Surfaces </li><li>Dynamic Compressed Hyperoctrees with Application to the N-body Problem </li><li>Largest Empty Rectangle among a Point Set </li><li>Renaming Is Necessary in Timed Regular Expressions </li><li>Product Interval Automata: A Subclass of Timed Automata </li><li>The Complexity of Rebalancing a Binary Search Tree </li><li>Fast Allocation and Deallocation with an Improved Buddy System </li><li>Optimal Bounds for Transformations of ω-Automata </li><li>CTL+ Is Exponentially More Succinct than CTL </li><li>A Top-Down Look at a Secure Message </li><li>Explaining Updates by Minimal Sums </li><li>A Foundation for Hybrid Knowledge Bases </li><li>Hoare Logic for Mutual Recursion and Local Variables </li><li>Explicit Substitutions and Programming Languages </li><li>Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings </li><li>A Randomized Algorithm for Flow Shop Scheduling </li><li>Synthesizing Distributed Transition Systems from Global Specifications </li><li>Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata </li><li>Implicit Temporal Query Languages: Towards Completeness </li><li>On the Undecidability of Some Sub-classical First-Order Logics</li></ul>