Volume 78, 2003
February 2003
CATS'03 Home Page
George Havas: On the Complexity of the Extended Euclidean Algorithm (extended abstract). 1-4- 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
- 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
- Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. 209-222
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team