Volume 61, 2002 CATS'02
the Australasian Theory Symposium
Michael R. Fellows
: Parameterized Complexity: The Main Ideas and Connections to Practical Computing.
: Dedekind completion as a method for constructing new Scott domains.
, John Mullins
: Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols.
: Drawing Ruled Surfaces Using the Dual De Boor Algorithm.
: Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.