CATS 2009: Wellington, New Zealand
Rod Downey, Prabhu Manyem (Eds.): Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. Australian Computer Society 2009 CRPIT 94 ISBN 978-1-920682-75-0- Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara: Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. 19-28
- Adam R. Day: On Process Complexity. 29-34
- Koji Nakazawa, Makoto Tatsuta: Type Checking and Inference for Polymorphic and Existential Types. 61-69
- Vladimir Estivill-Castro, Mahdi Parsa: Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity. 81-87
- Hideaki Fukuhara, Eiji Takimoto: Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. 89-98
- Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest Paths in Planar DAGs in Unambiguous Logspace. 99-105
- Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Boolean Affine Approximation with Binary Decision Diagrams. 119-127
- Andras Farago: Structural Properties of Random Graph Models. 129-136
- Kira Vyatkina: Linear Axis for Planar Straight Line Graphs. 137-150
- David J. Pearce, Gary Haggard, Gordon Royle: Edge-Selection Heuristics for Computing Tutte Polynomials. 151-159
- Sumit Ganguly: Distributing Frequency-Dependent Data Stream Computations. 161-167
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