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