Volume 61, 2002

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

last updated on Wed May 22 05:35:03 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page