Electronic Notes in Theoretical Computer Science, Volume 78

Volume 78, 2003

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