CATS'05 Accepted Papers

From: Mike Atkinson (mike_at_cs.otago.ac.nz)
Date: 10/19/04

  • Next message: Bill Wade: "Re: Proof that this assertion about heaps is true" 
    Date: Tue, 19 Oct 2004 14:55:13 +1300

    The following papers have been accepted for presentation at CATS'05
    (Computing: the Australasian Theory Symposium) which will be held in
    Newcastle NSW from 30 January to 3 February 2005. For more details see
    http://www.cs.otago.ac.nz/staffpriv/mike/CATS05/CATS05.html

    1. C. McCartin, R. Downey: Bounded Persistence Pathwidth
    2. A. Dekker: The Symmetry Ratio of a Network
    3. E. Prieto: The Method of Extremal Structure on the k-Maximum Cut
    Problem
    4. B. Dongol: Concurrent Program Design in the Extended Theory of Owicki
    and Gries
    5. S. Saunders: Efficient Algorithms for Solving Shortest Paths on
    Nearly Acyclic Digraphs
    6. T. Ishil: Minimum Cost Source Location Problem with Local
    3-Vertex-Connectivity Requirements
    7. M. Dumas: When are two Workflow Processes the Same?
    8. N. Danner: Circuit Principles and Weak Pigeonhole Variants
    9. K. Trentelman: Factorising temporal specifications
    10.M. Lanthier: Calculating the Meeting Point of Scattered Robots on
    Weighted Terrain Surfaces
    11.R. Solis-Oba: On packing squares with resource augmentation:
    maximizing the profit
    12. M. Compton: Stenning's Protocol Implemented in UDP and Verified in
    Isabelle
    13. D. Hemer: Plug-in proof support for formal development environments
    14. H. Machi: The Relative Completeness of the First-Order CTL*
    15. M. Persson: Approximate Clustering of Fingerprint Vectors with
    Missing Values

  • Next message: Bill Wade: "Re: Proof that this assertion about heaps is true"