|
| | | |
Volume 65 - Theory of Computing 2007Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Victoria, January 30 to February 2, 2007Australian Computer Science Communications, Vol. 29, No. 4This volume contains proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Victoria, January 30 to February 2, 2007. 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 62.1% (18 from 29). |
Volume CitationGudmundsson, J. and Jay, B., Eds. (2007). Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). CRPIT. 65. Ballarat, Australia, ACS.
Papers Included in the VolumeAhn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S. and Wolff, A. (2007). Constructing Optimal Highways. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 7-14. |
| Cheong, O., Haverkorty, H. and Lee, M. (2007). Computing a Minimum-Dilation Spanning Tree is NP-hard. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 15-24. |
| Coleman, T. and Teague, V. (2007). On The Complexity of Manipulating Elections. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 25-33. |
| Dawson, J.E. and Gore, R. (2007). Termination of Abstract Reduction Systems. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 35-43. |
| de Silva, L., Dekker, A. and Harland, J. (2007). Planning with Time Limits in BDI Agent Programming Languages. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 131-139. |
| Elmasry, A., Jensen, C. and Katajainen, J. (2007). On the Power of Structural Violations in Priority Queues. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 45-53. |
| Gao, P. and van der Meyden, R. (2007). A Linear Time Algorithm for Pricing European Sequential Barrier Options. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 55-62. |
| Gebauer, H. and Okamoto, Y. (2007). Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 63-69. |
| Harland, J. (2007). Analysis of Busy Beaver Machines via Induction Proofs. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 71-78. |
| Hung, R.Y.S. and Ting, H.F. (2007). An Optimal Broadcasting Protocol for Mobile Video-on-Demand. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 79-84. |
| Hvam, K., Reinhardt, L., Winter, P. and Zachariasen, M. (2007). Some Structural and Geometric Properties of Two-Connected Steiner Networks. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 85-90. |
| Ishii, T. (2007). Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 91-100. |
| Josang, A. (2007). Probabilistic Logic under Uncertainty. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 101-110. |
| Morris, P., Altenkirch, T. and Ghani, N. (2007). Constructing Strictly Positive Families. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 111-121. |
| Nielsen, B.K. (2007). An efficient solution method for relaxed variants of the nesting problem. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 123-130. |
| Palsberg, J. (2007). Register Allocation via Coloring of Chordal Graphs. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 3. |
| Tang, J., Balbuena, C., Lin, Y. and Miller, M. (2007). An open problem: (4; g)-cages with odd g <= 5 are tightly connected. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 141-144. |
| Taylor, R. (2007). Effective Prediction and its Computational Complexity. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 145-151. |
| Yamakami, T. (2007). Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. In Proc. Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Australia. CRPIT, 65. Gudmundsson, J. and Jay, B., Eds., ACS. 153-162. |
|
Papers listed: 19
|