| |
| | | |
Volume 41 - Theory of Computing 2005Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, NSW, Australia, January/February 2005Australian Computer Science Communications, Vol. 27, No. 4This volume contains the proceedings of the Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, NSW, Australia, January/February 2005. Where indicated, the paper is available for download in PDF or Postscript format. The series is published by, and most papers are copyright of, the Australian Computer Society Inc. Reproduction for academic research and not-for-profit purposes is granted provided the copyright notice on the first page of each paper is included. | |  | | Acceptance Rate Information.The full papers in this volume were peer refereed, in full, by an international programme committee. The acceptance rate was 42.9% (15 from 35). |
Volume CitationAtkinson, M. and Dehne, F., Eds. (2005). Theory of Computing 2005. Proceedings of the Eleventh Computing: The Australasian Theory Symposium (CATS2005). CRPIT. 41. Newcastle, Australia, ACS.
Papers Included in the Volume| Compton, M. (2005). Stenning's Protocol Implemented in UDP and Verified in Isabelle. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 21-30. |     
| | Dekker, A.H. and Colbert, B. (2005). The Symmetry Ratio of a Network. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 13-20. |
| | Downey, R.G. and McCartin, C. (2005). Bounded Persistence Pathwidth. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 51-56. |
| | Figueroa, A., Goldstein, A., Jiang, T., Kurowski, M., Lingas, A. and Persson, M. (2005). Approximate Clustering of Fingerprint Vectors with Missing Values. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 57-60. |
| | Fishkin, A.V., Gerber, O., Jansen, K. and Solis-Oba, R. (2005). On Packing Squares with Resource Augmentation: Maximizing the Profit. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 61-67. |
| | Goldson, D. and Dongol, B. (2005). Concurrent Program Design in the Extended Theory of Owicki and Gries. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 41-50. |
| | Hemer, D., Long, G. and Strooper, P. (2005). Plug-in Proof Support for Formal Development Environments. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 69-79. |
| | Hidders, J., Dumas, M., Aalst, W.M.P.v.d., Hofstede, A.H.M.t. and Verelst, J. (2005). When are two Workflows the Same?. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 3-11. |
| | Huisman, M. and Trentelman, K. (2005). Factorising Temporal Specifications. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 87-96. |
| | Ishii, T., Fujita, H. and Nagamochi, H. (2005). Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 97-105. |
| | Lanthier, M.A., Nussbaum, D. and Wang, T.-J. (2005). Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 107-118. |
| | Machi, H., Tomita, K. and Hosono, C. (2005). The Relative Completeness of a Version of CTL*. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 81-85. |
| | Pollett, C. and Danner, N. (2005). Circuit Principles and Weak Pigeonhole Variants. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 31-40. |
| | Prieto, E. (2005). The Method of Extremal Structure on the k-Maximum Cut Problem. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 119-126. |
| | Saunders, S. and Takaoka, T. (2005). Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. In Proc. Eleventh Computing: The Australasian Theory Symposium (CATS2005), Newcastle, Australia. CRPIT, 41. Atkinson, M. and Dehne, F., Eds., ACS. 127-131. |
|
Papers listed: 15
|
