| |
| | | |
Volume 51 - Theory of Computing 2006Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia, 16-19 January 2006Australian Computer Science Communications, Vol. 28, No. 4This volume contains proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia, 16-19 January 2006. 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 53.1% (17 from 32). |
Volume CitationGudmundsson, J. and Jay, B., Eds. (2006). Theory of Computing 2006. Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). CRPIT. 51. Hobart, Australia, ACS.
Papers Included in the Volume| Asahiro, Y., Miyano, E., Ono, H. and Zenmyo, K. (2006). Graph Orientation Algorithms to Minimize the Maximum Outdegree. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 11-20. |     
| | Asano, T. (2006). Computational Geometric and Combinatorial Approaches to Digital Halftoning. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 3. |
| | Ausiello, G., Giannakos, A. and Paschos, V.T. (2006). Greedy algorithms for on-line set-covering and related problems. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 145-151. |
| | Blazewicz, J. and Kasprzak, M. (2006). On the complexity of the DNA Simplified Partial Digest Problem. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 93-100. |
| | Dessmark, A., Jansson, J., Lingas, A., Lundell, E.-M. and Persson, M. (2006). On the Approximability of Maximum and Minimum Edge Clique Partition Problems. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 101-105. |
| | Harland, J. (2006). The Busy Beaver, the Placid Platypus and other Crazy Creatures. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 79-86. |
| | Hasunuma, T. (2006). Multilayer Grid Embeddings of Iterated Line Digraphs. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 21-26. |
| | Herlihy, B., Schachte, P. and Sondergaard, H. (2006). Boolean equation solving as graph traversal. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 123-132. |
| | Kelarev, A.V. (2006). A Polynomial Algorithm for Codes Based on Directed Graphs. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 87-92. |
| | Kolanski, R. and Klein, G. (2006). Formalising the L4 microkernel API. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 53-68. |
| | Li, S.C. (2006). Faster Algorithms for Finding Missing Patterns. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 107-111. |
| | Link, S. (2006). On the Logical Implication of Multivalued Dependencies with Null Values. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 113-122. |
| | Poon, C.K., Zheng, F. and Xu, Y. (2006). On-demand Bounded Broadcast Scheduling with Tight Deadlines. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 139-143. |
| | Rao, M.R.K.K. (2006). Learnability of Term Rewrite Systems from Positive Examples. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 133-137. |
| | Saabas, A. and Uustalu, T. (2006). Compositional Type Systems for Stack-Based Low-Level Languages. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 27-39. |
| | Smid, M. (2006). Geometric spanners with few edges and degree five. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 7-9. |
| | Takaoka, T. and Violich, S. (2006). Combinatorial Generation by Fusing Loopless Algorithms. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 69-77. |
| | Tian, Y.H. (2006). Mechanically Verifying Correctness of CPS Compilation. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds., ACS. 41-51. |
|
Papers listed: 18
|
