Electronic Notes in Theoretical Computer Science, Volume 91

Volume 91, 2004

• J. Ian Munro: Succinct Data Structures. 3
• Taolue Chen, Jingyang Zhou, Tingting Han, Jian Lu:
  Checking Strong Open Congruence in Chi -Calculus. 4-20
  
• Jeremy E. Dawson:
  Formalising General Correctness. 21-42
  
• William Duckworth:
  Small Edge Dominating Sets of Regular Graphs. 43-55
  
• Vladimir Estivill-Castro:
  Generating Nearly Sorted Sequences - The use of measures of disorder. 56-95
  
• Elio Giovannetti:
  Type Inference for Mobile Ambients in Prolog. 96-115
  
• David Hemer:
  Higher-order associative commutative pattern matching for component retrieval. 116-133
  
• Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
  Computing the Maximum Agreement of Phylogenetic Networks. 134-147
  
• Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To, Prudence W. H. Wong:
  Aggressive Online Deadline Scheduling. 148-157
  
• Neil Leslie, Edwin D. Mares:
  CHR: A Constructive Relevant Natural-deduction Logic. 158-170
  
• Sven Hartmann, Sebastian Link:
  A Membership Algorithm for Functional and Multi-valued Dependencies in the Presence of Lists. 171-194
  
• C. B. Jay, H. Y. Lu, Q. T. Nguyen:
  The Polymorphic Imperative: a Generic Approach to In-place Update. 195-211
  
• Greg O'Keefe:
  Towards a Readable Formalisation of Category Theory. 212-228
  
• Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
  How to Collect Balls Moving in the Euclidean Plane. 229-245
  
• Jean Flower, Gem Stapleton:
  Automated Theorem Proving with Spider Diagrams. 246-263