CATS 2011: Perth, Australia
Alex Potanin, Taso Viglas (Eds.): Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011. Australian Computer Society 2011 CRPIT 119 ISBN 978-1-920682-98-9- Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson: Faster Approximation Algorithms for Scheduling with Fixed Jobs. 3-10
- Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Minimum Mosaic Inference of a Set of Recombinants. 23-30
- John Augustine, Qi Han, Philip Loden, Sachin Lodha, Sasanka Roy: Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. 31-40
- Maram Alnafie, Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov: Sequential Optimization of Binary Search Trees for Multiple Cost Functions. 41-44
- N. S. Narayanaswamy, N. Sadagopan: A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. 45-54
- Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. 63-68
- Peter Floderus, Andrzej Lingas, Mia Persson: Towards More Efficient Infection and Fire Fighting. 69-74
- John Christopher McCabe-Dansted: On the Succinctness of RoCTL*. 85-94
- Aniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov: Descriptional Complexity of Determinization and Complementation for Finite Automata. 95-104
- Akira Suzuki, Kei Uchizawa, Xiao Zhou: Energy-Efficient Threshold Circuits Computing Mod Functions. 105-110
- Gianfranco Bilardi, Carlo Fantozzi: New Area-Time Lower Bounds for the Multidimensional DFT. 111-120
- Naoyuki Kamiyama, Tomomi Matsui: Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. 137-144
- Michael J. Dinneen, Masoud Khosravani: Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. 145-150
- James Harland: Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created). 151-160
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16T203152 by the dblp team