ISBN: 3-540-66836-5
TITLE: Foundations of Software Technology and Theoretical Computer Science
AUTHOR: Pandu Rangan, C.; Raman, V.; Ramanujam, R. (Eds.)
TOC:

Invited Talk 1
Recent Developments in the Theory of Arrangements of Surfaces 1
Micha Sharir
Session 1(a)
Dynamic Compressed Hyperoctrees with Application to the N-body Problem 21
Srinivas Aluru and Fatih E. Sevilgen
Largest Empty Rectangle among a Point Set 34
Jeet Chaudhuri and Subhas C. Nandy
Session 1(b)
Renaming Is Necessary in Timed Regular Expressions 47
Philippe Herrmann
Product Interval Automata: A Subclass of Timed Automata 60
Deepak D'Souza and P. S. Thiagarajan
Session 2(a)
The Complexity of Rebalancing a Binary Search Tree 72
Rolf Fagerberg
Fast Allocation and Deallocation with an Improved Buddy System 84
Erik D. Demaine and Ian J. Munro
Session 2(b)
Optimal Bounds for Transformations of omega-Automata 97
Christof Lding
CTL+ Is Exponentially More Succinct than CTL^+ 110
Thomas Wilke
Invited Talk 2
A Top-Down Look at a Secure Message 122
Martn Abadi, Cdric Fournet and Georges Gonthier
Session 3
Explaining Updates by Minimal Sums 142
Jrgen Dix and Karl Schlechta
A Foundation for Hybrid Knowledge Bases 155
James J. Lu, Neil V. Murray and Erik Rosenthal
Session 4
Hoare Logic for Mutual Recursion and Local Variables 168
David von Oheimb
Invited Talk 3
Explicit Substitutions and Programming Languages 181
Jean-Jacques Lvy and Luc Maranget
Session 5(a)
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings 201
Luca Becchetti, Miriam Di Ianni and Alberto Marchetti-Spaccamela
A Randomized Algorithm for Flow Shop Scheduling 213
Naveen Garg, Sachin Jain and Chaitanya Swamy
Session 5(b)
Synthesizing Distributed Transition Systems from Global Specifications 219
Ilaria Castellani, Madhavan Mukund and P. S. Thiagarajan
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata 232
Supratik Mukhopadhyay and Andreas Podelski
Session 6
Implicit Temporal Query Languages: Towards Completeness 245
Nicole Bidoit and Sandra de Amo
On the Undecidability of Some Sub-classical First-Order Logics 258
Matthias Baaz, Agata Ciabattoni, Christian Fermller and Helmut Veith
Invited Talk 4
How to Compute with DNA^* 269
Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney and Laura F. Landweber
Session 7(a)
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles 283
L. Sunil Chandran
Protecting Facets in Layered Manufacturing 291
Jrg Schwerdt, Michiel Smid, Ravi Janardan, Eric Johnson and Jayanth Majhi
Session 7(b)
The Receptive Distributed pi-Calculus (Extended Abstract) 304
Roberto M. Amadio, Grard Boudol and Cdric Lhoussaine
Series and Parallel Operations on Pomsets 316
Zoltn sik and Satoshi Okawa
Session 8
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus 329
Achour Mostfaoui and Michel Raynal
Invited Talk 5
Graph Isomorphism: Its Complexity and Algorithms 341
Seinosuke Toda
Session 9(a)
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables 342
Martin Sauerhoff
Lower Bounds for Linear Transformed OBDDs and FBDDs
(Extended Abstract) 356
Detlef Sieling
Session 9(b)
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems 369
Michael Huth
Graded Modalities and Resource Bisimulation 381
Flavio Corradini, Rocco De Nicola and Anna Labella
Session 10(a)
The Non-recursive Power of Erroneous Computation 394
Christian Schindelhauer and Andreas Jakoby
Analysis of Quantum Functions (Preliminary Version) 407
Tomoyuki Yamakami
Session 10(b)
On Sets Growing Continuously 420
Bernhard Heinemann
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract) 432
Ron van der Meyden and Nikolay V. Shilov
FST&TCS - ISAAC Joint Session Talks
The Engineering of Some Bipartite Matching Programs 446
Kurt Mehlhorn
Author Index 451
END
