CATS 2005: Newcastle, NSW, Australia
Mike D. Atkinson, Frank K. H. A. Dehne (Eds.): Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005. Australian Computer Society 2005 CRPIT 41 ISBN 1-920682-23-6- Michael Compton: Stenning's Protocol Implemented in UDP and Verified in Isabelle. 21-30
- Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate Clustering of Fingerprint Vectors with Missing Values. 57-60
- Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba: On Packing Squares with Resource Augmentation: Maximizing the Profit. 61-67
- Doug Goldson, Brijesh Dongol: Concurrent Program Design in the Extended Theory of Owicki and Gries. 41-50
- David Hemer, Gregory Long, Paul A. Strooper: Plug-in Proof Support for Formal Development Environments. 69-79
- Jan Hidders, Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Jan Verelst: When are two Workflows the Same? 3-11
- Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi: Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. 97-105
- Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang: Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. 107-118
- Elena Prieto: The Method of Extremal Structure on the k-Maximum Cut Problem. 119-126
- Shane Saunders, Tadao Takaoka: Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. 127-131
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team