Special Issue: CATS 2009

Selected papers from CATS 2009
Computing: The Australasian Theory Symposium
held in Wellington, New Zealand January 20-23 2009.

Guest Editors:
Rod Downey, Victoria University of Wellington, NZ and
Prabhu Manyem, Shanghai University, PRC.
June 2010

Articles
1. On Process Complexity by Adam R. Day.
2. On the Structure of Classes of Random Graphs by András Faragó.
3. Edge-Selection Heuristics for Computing Tutte Polynomials by David J. Pearce, Gary Haggard and Gordon Royle.
4. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs by Wataru Matsubara, Shunsuke Inenaga and Ayumi Shinohara.
5. Longest Paths in Planar DAGs in Unambiguous Log-Space by Nutan Limaye, Meena Mahajan and Prajakta Nimbhorkar.
6. Transformation Rules for Z by Mark Utting, Petra Maliky and Ian Toyn.
7. Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems by Koji Nakazawa and Makoto Tatsuta.
8. An Algorithm for Affine Approximation of Binary Decision Diagrams by Kevin Henshall, Peter Schachte, Harald Søndergaard and Leigh Whiting.
9. Distributing Frequency-Dependent Data Stream Computations by Sumit Ganguly.
Abstracts

Volume 2010
[back]

[back]

Published articles

[CJCTS home]