Computing Theory '98: Proceedings of the 4th Australasian Theory Symposium, CATS'98, Perth, 2-3 February 1998
Springer, Jan 1, 1998 - Computers - 305 pages
The papers in this volume were presented at "Computing: the 4th Australasian Theory Symposium", held 2-3 February 1998 at the University of Western Australia, Perth. The symposium brought together researchers in theoretical computer science throughout the Australasian region as well as Greece, Germany, Sweden, UK and USA. Of the 41 papers received, 20 were finally selected, rendering this publication a top-class review of the most recent work being done in Theory of Computation.
What people are saying - Write a review
We haven't found any reviews in the usual places.
adaptive sorting arc incident Association Rules axiom link binary bottom leaf bound Branching Algorithm call-by-need clause closed walk component intervals Computer Science constraints construct contains corresponding CREW PRAM decision tree defined delete denote destination node element encoding endpoints entropy field sieve formula function Heapsort independent spanning trees injection input integer intuitionistic irreducible subgraph key comparisons label lambda calculus Lemma line digraphs linear logic log log log2 lowest common ancestor maximum mergesort minimal minimum spanning trees MISGs node O(n log optimisation nets polynomial preprocessing probabilistic Proc processors Programming Qpath Qrange queries Red(A reducible region routing algorithm routing path Section sequence shortest sorting source node spanning trees rooted star graph Step structure subtree Suppose symbol cycle T|II tag variable term Theorem throw(u Tl|II tuples undirected unlabelled graph up-sequences values vertex virtual channels vital edge problem wormhole routing