Abstract is missing.
- When are two Workflows the Same?Jan Hidders, Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Jan Verelst. 3-11 [doi]
- The Symmetry Ratio of a NetworkAnthony H. Dekker, Bernard D. Colbert. 13-20 [doi]
- Stenning s Protocol Implemented in UDP and Verified in IsabelleMichael Compton. 21-30 [doi]
- Circuit Principles and Weak Pigeonhole VariantsChris Pollett, Norman Danner. 31-40 [doi]
- Concurrent Program Design in the Extended Theory of Owicki and GriesDoug Goldson, Brijesh Dongol. 41-50 [doi]
- Bounded Persistence PathwidthRodney G. Downey, Catherine McCartin. 51-56 [doi]
- Approximate Clustering of Fingerprint Vectors with Missing ValuesAndres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson. 57-60 [doi]
- On Packing Squares with Resource Augmentation: Maximizing the ProfitAleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba. 61-67 [doi]
- Plug-in Proof Support for Formal Development EnvironmentsDavid Hemer, Gregory Long, Paul A. Strooper. 69-79 [doi]
- The Relative Completeness of a Version of CTL*Hidetomo Machi, Kohji Tomita, Chiharu Hosono. 81-85 [doi]
- Factorising Temporal SpecificationsMarieke Huisman, Kerry Trentelman. 87-96 [doi]
- Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity RequirementsToshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi. 97-105 [doi]
- Calculating the Meeting Point of Scattered Robots on Weighted Terrain SurfacesMark Lanthier, Doron Nussbaum, Tsuo-Jung Wang. 107-118 [doi]
- The Method of Extremal Structure on the k-Maximum Cut ProblemElena Prieto. 119-126 [doi]
- Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed GraphsShane Saunders, Tadao Takaoka. 127-131 [doi]