CATS 2007: Ballarat, Victoria, Australia
Joachim Gudmundsson, C. Barry Jay (Eds.): Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings. Australian Computer Society 2007 CRPIT 65 ISBN 1-920-68246-5- Jens Palsberg: Register Allocation via Coloring of Chordal Graphs. 3
- Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. 7-14
- Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard. 15-24
- Amr Elmasry, Claus Jensen, Jyrki Katajainen: On the Power of Structural Violations in Priority Queues. 45-53
- Peng Gao, Ron van der Meyden: A Linear Time Algorithm for Pricing European Sequential Barrier Options. 55-62
- Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. 63-69
- James Harland: Analysis of Busy Beaver Machines via Induction Proofs. 71-78
- Regant Y. S. Hung, Hing-Fung Ting: An Optimal Broadcasting Protocol for Mobile Video-on-Demand. 79-84
- K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen: Some Structural and Geometric Properties of Two-Connected Steiner Networks. 85-90
- Toshimasa Ishii: Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs. 91-100
- Audun Jøsang: Probabilistic Logic under Uncertainty. 101-110
- Benny K. Nielsen: An efficient solution method for relaxed variants of the nesting problem. 123-130
- Lavindra de Silva, Anthony Dekker, James Harland: Planning with Time Limits in BDI Agent Programming Languages. 131-139
- Jianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller: An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. 141-144
- Richard Taylor: Effective Prediction and its Computational Complexity. 145-151
- Tomoyuki Yamakami: Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate. 153-162
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team