Volume 61,
2002
CATS'02
Computing:
the Australasian Theory Symposium
- James Harland:
Preface.
Electronic Edition (link) BibTeX
- Michael R. Fellows:
Parameterized Complexity: The Main Ideas and Connections to Practical Computing.
Electronic Edition (link) BibTeX
- John N. Crossley:
Declarative N. Programming: A logical view.
Electronic Edition (link) BibTeX
- Anthony H. Dekker:
A Category-Theoretic Approach to Social Network Analysis.
Electronic Edition (link) BibTeX
- Neil Ghani, Anne Heyworth:
Computing over K-modules.
Electronic Edition (link) BibTeX
- Michael Johnson, Robert D. Rosebrugh:
Sketch Data Models, Relational Schema and Data Specifications.
Electronic Edition (link) BibTeX
- Sebastian Link, Klaus-Dieter Schewe:
Towards an Arithmetic Theory of Consistency Enforcement based on Preservation of delta-constraints.
Electronic Edition (link) BibTeX
- Rakesh M. Verma, Sarah Hwang:
On the Structure of Counterexamples to Symmetric Orderings for BDD's.
Electronic Edition (link) BibTeX
- David Hemer, Ian J. Hayes, Paul A. Strooper, Robert Colvin:
Don't Care Non-determinism in Logic Program Refinement.
Electronic Edition (link) BibTeX
- Matthew Hennessy, Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping.
Electronic Edition (link) BibTeX
- Klaus Grue:
Dedekind completion as a method for constructing new Scott domains.
Electronic Edition (link) BibTeX
- Stéphane Lafrance, John Mullins:
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols.
Electronic Edition (link) BibTeX
- Rena Ding:
Drawing Ruled Surfaces Using the Dual De Boor Algorithm.
Electronic Edition (link) BibTeX
- Tadao Takaoka:
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.
Electronic Edition (link) BibTeX
- Stuart Anderson, John Power, Konstantinos Tourlas:
Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues.
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:58:15 2009
by Michael Ley (ley@uni-trier.de)