Abstract is missing.
- Recent Developments in the Theory of Arrangements of SurfacesMicha Sharir. 1-20 [doi]
- Dynamic Compressed Hypertoctrees with Application to the N-Body ProblemSrinivas Aluru, Fatih Erdogan Sevilgen. 21-33 [doi]
- Largest Empty Rectangle among a Point SetJeet Chaudhuri, Subhas C. Nandy. 34-46 [doi]
- Renaming is Necessary in Timed Regular ExpressionsPhilippe Herrmann. 47-59 [doi]
- Product Interval Automata: A Subclass of Timed AutomataDeepak D Souza, P. S. Thiagarajan. 60-71 [doi]
- The Complexity of Rebalancing a Binary Serach TreeRolf Fagerberg. 72-83 [doi]
- Fast Allocation and Deallocation with an Improved Buddy SystemErik D. Demaine, J. Ian Munro. 84-96 [doi]
- Optimal Bounds for Transformations of omega-AutomataChristof Löding. 97-109 [doi]
- CTL:::+::: is Exponentially more Succinct than CTLThomas Wilke. 110-121 [doi]
- A Top-Down Look at a Secure MessageMartín Abadi, Cédric Fournet, Georges Gonthier. 122-141 [doi]
- Explaining Updates by Minimal SumsJürgen Dix, Karl Schlechta. 142-154 [doi]
- A Foundation for Hybrid Knowledge BasesJames J. Lu, Neil V. Murray, Erik Rosenthal. 155-167 [doi]
- Hoare Logic for Mutual Recursion and Local VariablesDavid von Oheimb. 168-180 [doi]
- Explicit Substitutions and Programming LanguagesJean-Jacques Lévy, Luc Maranget. 181-200 [doi]
- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and RingsLuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela. 201-212 [doi]
- A Randomized Algorithm for Flow Shop SchedulingNaveen Garg, Sachin Jain, Chaitanya Swamy. 213-218 [doi]
- Synthesizing Distributed Transition Systems from Global SpecificationIlaria Castellani, Madhavan Mukund, P. S. Thiagarajan. 219-231 [doi]
- Beyond Region Graphs: Symbolic Forward Analysis of Timed AutomataSupratik Mukhopadhyay, Andreas Podelski. 232-244 [doi]
- Implicit Temporal Query Languages: Towards CompletenessNicole Bidoit, Sandra de Amo. 245-257 [doi]
- On the Undecidability of some Sub-Classical First-Order LogicsMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith. 258-268 [doi]
- How to Compute with DNALila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber. 269-282 [doi]
- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial RectanglesL. Sunil Chandran. 283-290 [doi]
- Protecting Facets in Layered ManufacturingJörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi. 291-303 [doi]
- The Receptive Distributed pi-Calculus (Extended Abstract)Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine. 304-315 [doi]
- Series and Parallel Operations on PomsetsZoltán Ésik, Satoshi Okawa. 316-328 [doi]
- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to ConsensusAchour Mostéfaoui, Michel Raynal. 329-340 [doi]
- Graph Isomorphism: Its Complexity and Algorithms (Abstract)Seinosuke Toda. 341 [doi]
- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic VariablesMartin Sauerhoff. 342-355 [doi]
- Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)Detlef Sieling. 356-368 [doi]
- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition SystemsMichael Huth. 369-380 [doi]
- Graded Modalities and Resource BisimulationFlavio Corradini, Rocco De Nicola, Anna Labella. 381-393 [doi]
- The Non-Recursive Power of Erroneous ComputationChristian Schindelhauer, Andreas Jakoby. 394-406 [doi]
- Analysis of Quantum Functions (Preliminary Version)Tomoyuki Yamakami. 407-419 [doi]
- On Sets Growing ContinouslyBernhard Heinemann. 420-431 [doi]
- Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)Ron van der Meyden, Nikolay V. Shilov. 432-445 [doi]
- The Engineering of some Bipartite Matching ProgramsKurt Mehlhorn. 446-449 [doi]