Computer Science

University Home | Department Home | Research | Department

Jens Blanck, BA, PhD (Uppsala)

ATYlogo
Research Interests: computability; domain theory; continuous data types, topological spaces; mathematical logic.

Contact:
Telephone: +44 (0)1792 602917
E-mail: j.e.blanck@swan.ac.uk

Publications

Refereed Papers

  1. J. Blanck, Domain representability of metric spaces, Annals of Pure and Applied Logic 83 (1997), 225-247. (pdf)
  2. J. Blanck, Domain representability (Extended abstract), Electronic Notes in Theoretical Computer Science 13 (1998). (pdf)
  3. J. Blanck, V. Stoltenberg-Hansen and J. V. Tucker, Streams, stream transformers and domain representations, in B. Moeller and J. V. Tucker, Prospects for Hardware Foundations, Springer LNCS vol. 1546, 1998. (pdf)
  4. J. Blanck, Effective domain representations of H(X), the space of compact subsets, Theoretical Computer Science 219 (1999) 19-48. (pdf)
  5. J. Blanck, Domain representations of topological spaces, Theoretical Computer Science 247 (2000), 229-255. (pdf)
  6. J. Blanck, Effectivity of regular spaces, in [11], pages 1-15. (pdf)
  7. J. Blanck, V. Stoltenberg-Hansen and J. V. Tucker, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry, Theoretical Computer Science 28 (2002) 207-240. (pdf)
  8. J. Blanck, Efficient exact computation of iterated maps, Journal of Logic and Algebraic Programming 64 (2005), 41-59. (pdf)
  9. J. Blanck, Exact real arithmetic using centred intervals and bounded error terms. Journal of Logic and Algebraic Programming 66 (2006), 207-240. (pdf)
  10. J. Blanck, Reducibility of domain representations and Cantor-Weihrauch domain representations, Mathematical Structures in Computer Science 18 (2008), 1031-1056, doi:10.1017/S0960129508007093. (pdf)

Books

  1. Jens Blanck, Vasco Brattka and Peter Hertling (editors), Computability and Complexity in Analysis, Lecture Notes in Computer Science, vol 2064, Springer, 2001.

Proceedings

  1. J. Blanck, Note on reducibility between domain representations. In A. Beckmann et al. (eds), Logical Approaches to Computational Barriers, CSR 7-2006, Dept. of Computer Science, Swansea University, 24-36, 2006.
  2. J. Blanck, V. Stoltenberg-Hansen, J. V. Tucker, Stability for effective algebras, Electronic Notes in Theoretical Computer Science 221 (2008), 3-15, doi:10.1016/j.entcs.2008.12.002. (pdf)

Theses

  1. J. Blanck, Licentiatsavhandling, Domain representability of metric spaces, U.U.D.M. Report 1995:20.
  2. J. Blanck, Computability on topological spaces by effective domain representations, Uppsala Dissertations in Mathematics 7, 1997. (gzipped ps)

Reports and Manuscripts

  1. J. Blanck, Continuous data types and processes. Course notes, 2000.
  2. J. Blanck, Exact Real Arithmetic Systems, Results of Competition, in [10], pages 390-394. (pdf)
  3. J. Blanck, General purpose exact real arithmetic, CSR 21-2002, Dept. of Computer Science, University of Wales Swansea, 2002. (pdf)
  4. J. Blanck, Reducibility of Domain Representations and Cantor-Weihrauch Domain Representations, CSR 15-2006, Dept. of Computer Science, Swansea University, 2006. (pdf)