LFCS reports by Author: D

Dam, Mads

• Relevance Logic and Concurrent Composition
  Mads Dam
  LFCS report ECS-LFCS-90-119 (also published as CST-66-90)
  
• Translating CTL* into the modal mu-calculus
  Mads Dam
  LFCS report ECS-LFCS-90-123
  
• Process-Algebraic Interpretations of Positive Linear and Relevant Logics
  Mads Dam
  LFCS report ECS-LFCS-92-216
  
• CTL* and ECTL* as fragments of the modal mu-calculus
  Mads Dam
  LFCS report ECS-LFCS-92-217
  
• Fixpoints of Büchi automata
  Mads Dam
  LFCS report ECS-LFCS-92-224
  

Denney, Ewen

• A Theory of Program Refinement
  Ewen Denney
  LFCS report ECS-LFCS-99-412
  

Diaconescu, Razvan

• Hiding and Behaviour: An Institutional Approach
  Rod Burstall and Razvan Diaconescu
  LFCS report ECS-LFCS-92-253
  

Duggan, Angus

• Literate Programming: A Review
  Angus Duggan
  LFCS report ECS-LFCS-93-263
  

Dyer, Martin

• Approximately Counting Hamilton Cycles in Dense Graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-93-259
  
• A New Approach to Polynomial-time Generation of Random Points in Convex Bodies
  Russ Bubley, Martin Dyer and Mark Jerrum
  LFCS report ECS-LFCS-96-343
  
• On counting independent sets in sparse graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-98-391