LFCS reports by Author: F

Fachini, _

• Classes of Systolic Y-Tree Automata and a Comparison with Systolic trellis Automata
  Sangiorgi, Fachini and Schettina
  LFCS report ECS-LFCS-91-166
  

Fairtlough, Matt

• Ordinal Complexity of Recursive Programs and their Termination Proofs
  M Fairtlough
  LFCS report ECS-LFCS-92-196 (also published as CST-88-92)
  

Farrés-Casals, Jorge

• Proving correctness of constructor implementations
  Jorge Farrés-Casals
  LFCS report ECS-LFCS-89-72
  
• Proving correctness w.r.t. specifications with hidden parts
  Jorge Farrés-Casals
  LFCS report ECS-LFCS-90-117
  
• Verification in ASL and related specification languages
  Jorge Farrés-Casals
  LFCS report ECS-LFCS-92-220 (also published as CST-92-92)
  

Felici, Massimo

• Observational Models of Requirements Evolution
  Massimo Felici
  

Finn, Simon

• Partial Functions in a Total Setting
  Simon Finn, Michael Fourman and John Longley
  LFCS report ECS-LFCS-96-341
  

Fiore, Marcelo P

• Axiomatic Domain Theory in Categories of Partial Maps
  Marcelo P. Fiore
  LFCS report ECS-LFCS-94-307
  
• First Steps on the Representation of Domains
  Marcelo P Fiore
  LFCS report ECS-LFCS-95-331
  

Fourman, Michael P

• A proposed categorical semantics for Pure ML
  Wesley Phoa and Michael Fourman
  LFCS report ECS-LFCS-92-213
  
• Proof and Design
  Michael P. Fourman
  LFCS report ECS-LFCS-95-319
  
• Partial Functions in a Total Setting
  Simon Finn, Michael Fourman and John Longley
  LFCS report ECS-LFCS-96-341
  

Frieze, Alan

• Approximately Counting Hamilton Cycles in Dense Graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-93-259
  
• Improved approximation algorithms for MAX k-CUT and MAX BISECTION
  Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-94-292
  
• Generating and counting Hamilton cycles in random regular graphs
  Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson and Nicholas Wormald
  LFCS report ECS-LFCS-94-313
  
• On counting independent sets in sparse graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-98-391
  

Fröschle, Sibylle

• Decidability and Coincidence of Equivalences for Concurrency
  Sibylle Fröschle
  

Führmann, Carsten

• Direct models for the computational lambda-calculus
  Carsten Führmann
  LFCS report ECS-LFCS-98-400
  
• The structure of call-by-value
  Carsten Führmann