• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 20 matches

• 2003
• 
  Chiara Braghin, Agostino Cortesi, Riccardo Focardi:
  Information Leakage Detection in Boundary Ambients. CATS 2003: 123-143
• 
  Mao-cheng Cai, Xiaotie Deng:
  Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market. CATS 2003: 293-302
• 
  Mario Coppo, Mariangiola Dezani-Ciancaglini, Elio Giovannetti, Ivano Salvo:
  Mobility Types for Mobile Processes in Mobile Ambients. CATS 2003: 144-177
• 
  Jeremy E. Dawson, Rajeev Goré:
  A New Machine-checked Proof of Strong Normalisation for Display Logic. CATS 2003: 20-39
• 
  Michael J. Dinneen, Nian Zhou:
  An Optimal Family of Bounded-Degree Broadcast Networks. CATS 2003: 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. CATS 2003: 209-222
• 
  William Duckworth, Michele Zito:
  Large 2-Independent Sets of Regular Graphs. CATS 2003: 223-235
• 
  Guido Governatori:
  On the Relative Complexity of Labelled Modal Tableaux. CATS 2003: 40-57
• 
  James Harland:
  Preface. CATS 2003: 303-304
• 
  George Havas:
  On the Complexity of the Extended Euclidean Algorithm (extended abstract). CATS 2003: 1-4
• 
  Maurice Herlihy, Victor Luchangco, Mark Moir:
  Space and Time Adaptive Non-blocking Algorithms. CATS 2003: 260-280
• 
  Aleksandar Ignjatovic, Phuong Minh Nguyen:
  Characterizing polynomial time computable functions using theories with weak set existence principles. CATS 2003: 112-122
• 
  Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
  Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. CATS 2003: 236-259
• 
  Michael Johnson, Robert D. Rosebrugh:
  Three approaches to Partiality in the Sketch Data Model. CATS 2003: 82-99
• 
  Karl Lermer, Colin J. Fidge, Ian J. Hayes:
  Formal Semantics for Program Paths. CATS 2003: 58-81
• 
  Yutaka Matsuno, Hiroyuki Sato:
  Flow Analytic Type System for Array Bound Checks. CATS 2003: 178-195
• 
  Nicoletta Sabadini, Robert F. C. Walters:
  Hierarchical Automata and P-systems. CATS 2003: 5-19
• 
  Tadao Takaoka:
  The Reverse Problem of Range Query. CATS 2003: 281-292
• 
  David A. Wright:
  Linearity and Passivity. CATS 2003: 100-111
• 
  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 [contents]