Electronic Notes in Theoretical Computer Science, Volume 61

Volume 61, 2002

• James Harland:
  Preface.
  
• Michael R. Fellows:
  Parameterized Complexity: The Main Ideas and Connections to Practical Computing.
  
• John N. Crossley:
  Declarative N. Programming: A logical view.
  
• Anthony H. Dekker:
  A Category-Theoretic Approach to Social Network Analysis.
  
• Neil Ghani, Anne Heyworth:
  Computing over K-modules.
  
• Michael Johnson, Robert D. Rosebrugh:
  Sketch Data Models, Relational Schema and Data Specifications.
  
• Sebastian Link, Klaus-Dieter Schewe:
  Towards an Arithmetic Theory of Consistency Enforcement based on Preservation of delta-constraints.
  
• Rakesh M. Verma, Sarah Hwang:
  On the Structure of Counterexamples to Symmetric Orderings for BDD's.
  
• David Hemer, Ian J. Hayes, Paul A. Strooper, Robert Colvin:
  Don't Care Non-determinism in Logic Program Refinement.
  
• Matthew Hennessy, Julian Rathke:
  Typed behavioural equivalences for processes in the presence of subtyping.
  
• Klaus Grue:
  Dedekind completion as a method for constructing new Scott domains.
  
• Stéphane Lafrance, John Mullins:
  Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols.
  
• Rena Ding:
  Drawing Ruled Surfaces Using the Dual De Boor Algorithm.
  
• Tadao Takaoka:
  Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.
  
• Stuart Anderson, John Power, Konstantinos Tourlas:
  Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues.