Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 13 Jan 2014

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Volume 65 - Theory of Computing 2007

Thirteenth Computing: The Australasian Theory Symposium (CATS2007), Ballarat, Victoria, January 30 to February 2, 2007

Australian Computer Science Communications, Vol. 29, No. 4

This 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.

Edited by

Joachim Gudmundsson and Barry Jay.

Published

January 2007.

ISBN-13

1-920-68246-5.

ISSN

1445-1336.

19 Papers, xvi+164 pages, softcover.

Order or Recommend this Volume.

BiBTeX file for Volume.

Complete Volume.

Click for larger view
 
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 Citation

Gudmundsson, 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 Volume

Ahn, 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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. pdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. BibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

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. abstractpdfBibTeXEndNoteGS

Papers listed: 19

 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 20 Mar 2007