Jyrki in AD 2008

Jyrki Katajainen

Associate Professor, Department of Computing, University of Copenhagen
Leader of the Performance Engineering Laboratory
Buy it!

Change log:

  • Talk at the Max-Planck-Institut für Informatik [pdf]
  • Slides from our strategy seminar [pdf]
  • Most of my publications are now online [by category] [by year]

Contact Addresses

  • Postal address: Universitetsparken 1, DK-2100 Copenhagen East, Denmark.
  • Office: 3.1.13
  • Telefax: (+45) 35 32 14 01
  • Electronic Mail: jyrki@diku.dk

General Information

Teaching

Research

My scientific work falls into several (overlapping) fields: algorithmic graph theory, computational complexity, computational geometry, data compression, parallel computing, performance programming, software tools, and sorting and searching. Currently, the active areas of research are experimental algorithmics, theoretical algorithmics, and software tools.

Recent Talks

  • A talk at the Max-Planck-Institut für Informatik, 16 Jan 2009: Comparison complexity of priority-queue operations [pdf]
  • A talk at our strategy seminar, 19 Nov 2008: Golden advice from the handbook [pdf]
  • A talk at the seminar on Algorithm Engineering held in Mathematisches Forchungsinstitut Oberwolfach, 8 May 2007: Stronger guarantees for standard-library containers [pdf]
  • A talk at the University of Melbourne/Sydney, 6/14 February 2007: Putting your data structure on a diet [pdf]
  • 13th Computing: The Australasian Theory Symposium, 1 February 2007: On the power of structural violations in priority queues [pdf]
  • 5th STL Workshop held at DIKU, 21 June 2005: Relaxed weak queues: an alternative to run-relaxed heaps [pdf] [ps]
  • 25th anniversary on the stage as a university teacher, October 2004: Jubilee lecture "Anatomy of a worst-case efficient priority queue" given at several places [ps] [tour details]
  • A talk at Chalmers University of Technology, Göteborg, 12 May 2004: The cost of iterator validity [ps]
  • A talk at the University of Helsinki, Helsinki, 8 December 2003: The current truth about heaps [pdf]
  • 4th STL Workshop held at DIKU, 26 May 2003: The first four months of our benchmark tool [pdf]
  • 8th Scandinavian Workshop on Algorithm Theory, Turku, 5 July 2002: A randomized in-place algorithm for positioning the k'th element in a multiset [pdf]
  • An invited talk at Dansk Selskab for Datalogi, Copenhagen, 13 June 2002: Software tools for program library development [pdf]
  • 8th ARCO Workshop, Copenhagen, 14 January 2002: In-place planar convex hull algorithms [pdf]
  • 3rd STL Workshop held at DIKU, 17 December 2001: New CPH STL headers <compile-time-assert> and <type> [pdf]
  • A talk at Stockholm University, Stockholm, 26 October 2001: Sequence comparison [pdf]
  • A talk at Chalmers University of Technology, Göteborg, 11 June 2001: Space-efficient vectors and deques [pdf]
  • An invited talk given jointly with Christopher Derek Curry at Tietojenkäsittelytieteen päivät, Turku, 21 May 2001: Teaching process reengineering at DIKU [pdf]
  • 2nd STL Workshop held at DIKU, 23 April 2001: Status of the CPH STL project [ps]
  • 5th ARCO Meeting, Copenhagen, 26 May 2000: Methodological issues in algorithm experimentation: a case study of heaps [ps]
  • 3rd International Workshop on Algorithm Engineering, London, 21 July 1999: Performance engineering case study: heap construction [ps]
This page was last modified by Jyrki Katajainen on 03.06.2009.