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