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.
|Product dimensions:||6.10(w) x 9.25(h) x (d)|
Table of ContentsKeynote Addresses: "Average-case analysis using Kolmogorov complexity" ÄAbstractÜ (M Li & P Vitanyi). "Application of algorithm thoery to data mining" (T Tokuyama).- Archetypal Presentation Papers include: Independent spanning trees with small depths in iterated line digraphs (T Hasunuma & H Nagamochi). Delayed correction - Binary search with errors made very simple but efficient (F Albers & P Damaschke). Filters for graph matching (S Callaghan et al). Separating weakening and contraction in a linear lambda calculus (J Maraist). Alignment of low information sequences (DR Powell et al). A Banach space based semantics for probabilistic concurrent constraint programming (A di Pierro & H Wiklicky). ...and other papers...