|
| | | |
Volume 141 - Nineteenth Computing: The Australasian Theory Symposium(CATS 2013), Adelaide, Australia, February 2013This volume contains papers presented at the Nineteenth Computing: The Australasian Theory Symposium (CATS 2013), Adelaide, Australia, February 2013. 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 46.7% (7 from 15). |
Volume CitationAnthony Wirth Eds. (2013). Proceedings of the Nineteenth Computing: The Australasian Theory Symposium (CATS 2013). CRPIT. 141. Adelaide, Australia, ACS.
Papers Included in the VolumeBrass, P., Knauer, C., Shin, C. and Smid, M. (2013). Range-Aggregate Queries for Geometric Extent Problems. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 3-10. |
| Chan, H.L., Chan, S.H., Lam, T.W., Lee, L.K., Li, R. and Liu, C.M. (2013). Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 11-20. |
| Lam, F. and Wong, R.K. (2013). Rotated Library Sort. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 21-26. |
| Karpinski, M. and Schmied, R. (2013). Improved Inapproximability Results for the Shortest Superstring and Related Problems. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 27-36. |
| Uchizawa, K., Wang, Z., Morizumi, H. and Zhou, X. (2013). Complexity of Counting Output Patterns of Logic Circuits. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 37-43. |
| Harland, J. (2013). Busy Beaver Machines and the Observant Otter Heuristic. In Proc. Theory of Computing 2013 (CATS 2013), Adelaide, Australia. CRPIT, 141. Wirth, A. Eds., ACS. 53-52. |
|
Papers listed: 6
|