![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
9th CATS 2003: Adelaide, SA, Australia
- James Harland:
Computing: the Australasian Theory Symposiumm, CATS 2003, Adelaide, SA, Australia, February 4-7, 2003. Electronic Notes in Theoretical Computer Science 78, Elsevier 2003 - George Havas:
On the Complexity of the Extended Euclidean Algorithm (extended abstract). 1-4 - Nicoletta Sabadini, Robert F. C. Walters:
Hierarchical Automata and P-systems. 5-19 - Jeremy E. Dawson
, Rajeev Goré:
A New Machine-checked Proof of Strong Normalisation for Display Logic. 20-39 - Guido Governatori
:
On the Relative Complexity of Labelled Modal Tableaux. 40-57 - Karl Lermer, Colin J. Fidge
, Ian J. Hayes
:
Formal Semantics for Program Paths. 58-81 - Michael Johnson
, Robert D. Rosebrugh:
Three approaches to Partiality in the Sketch Data Model. 82-99 - David A. Wright:
Linearity and Passivity. 100-111 - Aleksandar Ignjatovic, Phuong Minh Nguyen:
Characterizing polynomial time computable functions using theories with weak set existence principles. 112-122 - Chiara Braghin, Agostino Cortesi
, Riccardo Focardi
:
Information Leakage Detection in Boundary Ambients. 123-143 - Mario Coppo, Mariangiola Dezani-Ciancaglini, Elio Giovannetti, Ivano Salvo:
Mobility Types for Mobile Processes in Mobile Ambients. 144-177 - Yutaka Matsuno, Hiroyuki Sato:
Flow Analytic Type System for Array Bound Checks. 178-195 - Michael J. Dinneen
, Nian Zhou:
An Optimal Family of Bounded-Degree Broadcast Networks. 196-208 - Rodney G. Downey, Vladimir Estivill-Castro
, Michael R. Fellows
, Elena Prieto-Rodriguez
, Frances A. Rosamond:
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. 209-222 - William Duckworth, Michele Zito:
Large 2-Independent Sets of Regular Graphs. 223-235 - Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. 236-259 - Maurice Herlihy, Victor Luchangco, Mark Moir:
Space and Time Adaptive Non-blocking Algorithms. 260-280 - Tadao Takaoka:
The Reverse Problem of Range Query. 281-292 - Mao-cheng Cai, Xiaotie Deng
:
Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market. 293-302 - James Harland:
Preface. 303-304
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.