Dr Jens Blanck
Associate Professor
Computer Science
Telephone: (01792) 602917
Room: Office - 333
Third Floor
Computational Foundry
Bay Campus

Areas of Expertise

  • computability
  • domain theory
  • domain representations
  • computable real numbers
  • exact computations
  • exact real arithmetic
  • continuous data types


  1. Bauer, A., Blanck, J. Canonical effective subalgebras of classical algebras as constructive metric completions Journal of Universal Computer Science 16 18 2496 2522
  2. Blanck, J. Reducibility of domain representations and Cantor–Weihrauch domain representations Mathematical Structures in Computer Science 18 06 1031 1056
  3. Blanck, J., Blanck, J. Efficient exact computation of iterated maps The Journal of Logic and Algebraic Programming 64 1 41
  4. Blanck, J., Stoltenberg-Hansen, V., Tucker, J., Blanck, J. Domain representations of partial functions, with applications to spatial objects and constructive volume geometry Theoretical Computer Science 284 2 207
  5. Blanck, J., Blanck, J. Exact real arithmetic using centred intervals and bounded error terms The Journal of Logic and Algebraic Programming 66 1 50

See more...


  • CS-270 Algorithms

    This module introduces students to the formal concepts of algorithms and data structures and will enable them to understand how the selection of different algorithms and data types affects the performance and efficiency of a program. Particular attention will be paid to the fundamental problems of searching, sorting, and graph traversal.


  • Implementing Prawf with Program Extraction and Case Studies for Sequent Calculus Rules (current)

    Other supervisor: Dr Ulrich Berger
    Other supervisor: Dr Ulrich Berger
    Other supervisor: Dr Ulrich Berger