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 119 - Seventeenth Computing: The Australasian Theory Symposium

(CATS 2011), Perth, Australia, January 2011

This volume contains papers presented at the Seventeenth Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia, January 2011. 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

Alex Potanin and Taso Viglas.

Published

January 2009.

ISBN-13

978-1-920682-98-9.

ISSN

1445-1336.

20 Papers, xiv+169 pages.

BiBTeX file for Volume.

Complete Volume.

 
Acceptance Rate Information.

The full papers in this volume were peer refereed, in full, by an international programme committee. The acceptance rate was 52.6% (20 from 38).


Volume Citation

Papers Included in the Volume

Jansen, K. Praedel, L., Schwarz, U. M. and Svensson, O. (2011). Faster Approximation Algorithms for Scheduling with Fixed Jobs. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 3-10. abstractpdfBibTeXEndNoteGS

Kolla, A. and Lee, J. (2011). Sparsest Cut on Quotients of the Hypercube. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 11-22. abstractpdfBibTeXEndNoteGS

Blin, G., Rizzi, R., Sikora, F. and Vialette, S. (2011). Minimum Mosaic Inference of a Set of Recombinants. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 23-30. abstractpdfBibTeXEndNoteGS

Augustine, J., Han, Q., Loden, P., Lodha, S. and Roy, S. (2011). Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 31-40. abstractpdfBibTeXEndNoteGS

Alnae, M., Chikalov, I., Hussain, S. and Moshkov, M. (2011). Sequential Optimization of Binary Search Trees for Multiple Cost Functions. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 41-44. abstractpdfBibTeXEndNoteGS

Narayanaswamy, N. S. and Sadagopan, N. (2011). A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 45-54. abstractpdfBibTeXEndNoteGS

Miyano, E. and Ono, H. (2011). Maximum Domination Problem. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 55-62. abstractpdfBibTeXEndNoteGS

Nonaka, Y., Ono, H., Kijima, S. and Yamashita, M. (2011). How Slow, or Fast, Are Standard Random Walks? – Analyses of Hitting and Cover Times on Tree. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 63-68. abstractpdfBibTeXEndNoteGS

Floderus, P., Lingas, A. and Persson, M. (2011). Towards More Efficient Infection and Fire Fighting. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 69-74. abstractpdfBibTeXEndNoteGS

Ware, S. and Malik, R. (2011). A Process-Algebraic Semantics for Generalised Nonblocking. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 75-84. abstractpdfBibTeXEndNoteGS

McCabe-Dansted, J. (2011). On the Succinctness of RoCTL*. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 85-94. abstractpdfBibTeXEndNoteGS

Gandhi, A., Ke, N. and Khoussainov, B. (2011). Descriptional Complexity of Determinization and Complementation for Finite Automata. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 95-104. abstractpdfBibTeXEndNoteGS

Suzuki, A., Uchizawa, K. and Zhou, X. (2011). Energy-Efficient Threshold Circuits Computing Mod Functions. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 105-110. abstractpdfBibTeXEndNoteGS

Bilardi, G. and Fantozzi, C. (2011). New Area-Time Lower Bounds for the Multidimensional DFT. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 111-120. abstractpdfBibTeXEndNoteGS

Hung, L.-J., Kloks, T. and Villaamil, F. S. (2011). Black-and-White Threshold Graphs. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 121-130. abstractpdfBibTeXEndNoteGS

Takaoka, T. and Hashim, M. (2011). Sharing Information in All Pairs Shortest Path Algorithms. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 131-136. abstractpdfBibTeXEndNoteGS

Kamiyama, N. and Matsui, T. (2011). Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 137-144. abstractpdfBibTeXEndNoteGS

Dinneen, M. J. and Khosravani, M. (2011). Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 145-150. abstractpdfBibTeXEndNoteGS

Harland, J. (2011). Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created). In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 151-160. abstractpdfBibTeXEndNoteGS

Koutris, P. and Pagourtzis, A. (2011). Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. In Proc. Computing: The Australasian Theory Symposium (CATS 2011), Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 161-168. abstractpdfBibTeXEndNoteGS

Papers listed: 20

 

 

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 5 Jan 2011