UU.NL HOME cs.uu.nl

PhD theses

PhD theses of the department of Computer Science, Utrecht University, appearing in the ftp-archive.
  • Thomas Arts
    Automatically proving termination and innermost normalisation of term rewriting systems.
  • Remco Bouckaert
    Bayesian Belief Networks: From Construction to Inference.
  • Babette de Fluiter
    Algorithms for Graphs of Small Treewidth.
  • Michiel Hagedoorn
    Pattern matching using similarity measures.
  • Paul Harrenstein
    Logic in conflict.
  • Marten van Hulst
    Compositional Verification of Parallel Programs.
    Using Epistemic Logic and Abstract Assertional Languages
  • Maria Ferreira
    Termination of Term Rewriting.
    Well-foundedness, Totality and Transformations.
  • Goos Kant
    Algorithms for Drawing Planar Graphs.
  • Bernd van Linder
    Modal Logics for Rational Agents.
  • Rene van Oostrum
    Geometric Algorithms for Geographic Information Systems.
  • Maarten Pennings
    Generating incremental attribute evaluators.
  • Whishnu Prasetya
    Mechanically Supported Design of Self-stabilizing Algorithms.
  • Frans Rietman
    A relational calculus for the design of distributed algorithms.
  • Joao Saraiva
    Purely Functional Implementation of Attribute Grammars.
  • Hans Tangelder
    Automated Fabrication of Shape Models of Free-form Objects with a Sculpturing Robot.
  • Rob Udink
    Program Refinement in UNITY-like Environments.
  • Jacques Verriet
    Scheduling with communication for multiprocessor computation.
  • Bram Verweij
    Selected applications of Integer Programming: A Computational Study.
  • Jules M. Vleugels
    On Fatness and Fitness - Realistic Input Models for Geometric Algorithms.
  • Tanja E. J. Vos
    UNITY in Diversity - A stratified approach to the verification of distributed algorithms.
    • UU CS INFO FIND INDEX
    library@cs.uu.nl, Thu Jan 17 10:55:19 MET 2002