Department of Computer Science

Research output

Research output per year 1986 2013 2014 2015 2016 2017 2024

• 720 Article in proceedings
• 459 Journal article
• 82 Book chapter
• 57 Report
• 403 More
  • 52 Ph.D. thesis
  • 38 Paper
  • 37 Book
  • 36 Conference abstract for conference
  • 36 Conference abstract in journal
  • 35 Working paper
  • 24 Editorial
  • 18 Conference article
  • 17 Anthology
  • 17 Conference abstract in proceedings
  • 13 Report chapter
  • 13 Poster
  • 13 Review
  • 13 Patent
  • 7 Comment
  • 6 Comment/debate
  • 5 Encyclopedia chapter
  • 5 Preprint
  • 3 Preface/postscript
  • 3 Letter
  • 2 Contribution to newspaper - Comment/debate
  • 2 Computer programme
  • 2 Other contribution
  • 1 Compendium/lecture notes
  • 1 Doctoral thesis
  • 1 Contribution to newspaper - Feature article
  • 1 Dataset
  • 1 Sound/Visual production (digital)
  • 1 Net publication - Internet publication

Research output per year

Research output per year

Search results

• 2020

  Imperative versus Declarative Process Mining: An Empirical Comparison

  Back, C. O., Debois, S. & Slaats, T., 2020, Department of Computer Science, University of Copenhagen, 14 p.

  Research output: Working paper

  File
  189 Downloads (Pure)
• 2009

   Optimizing relational algebra operations using discrimination-based joins and lazy products

  Henglein, F., 2009, København: Museum Tusculanum, p. 32.

  Research output: Working paper

• Priority-queue framework: Programs

  Katajainen, J., 2009, 7 ed., København, 122 p.

  Research output: Working paper

• Vector framework: Electronic appendix

  Katajainen, J. & Simonsen, B., 2009, København: Department of Computer Science, University of Copenhagen, 67 p.

  Research output: Working paper
• 2008

  Essays on C++ concepts

  Katajainen, J., 2008, 14 p.

  Research output: Working paper

• Mini-project: Safe standard-library containers

  Katajainen, J., 2008, 2 ed., 6 p.

  Research output: Working paper

• Project description: Foundations and tools for building well-behaved systems

  Katajainen, J., Elmasry, A., Elverkilde, J. D., Jensen, C., Rasmussen, J., Simonsen, B., Yde, L., Artho, C., Francechini, G. & Schupp, S., 2008, København: Department of Computer Science, University of Copenhagen, p. 1-7, 7 p.

  Research output: Working paper

  Open Access

  File
  1859 Downloads (Pure)
• 2007

  Intrinsically defined sorting functions

  Henglein, F., 2007.

  Research output: Working paper

• Project proposal: Associative containers with strong guarantees. CPH STL Report 2007-4

  Katajainen, J., 2007, 39 p.

  Research output: Working paper

• Putting your data structure on a diet

  Brönnimann, H., Katajainen, J. & Morin, P., 2007.

  Research output: Working paper
• 2006

  An experimental evaluation of navigation piles

  Jensen, C. & Katajainen, J., 2006, Department of Computer Science, University of Copenhagen, 16 p.

  Research output: Working paper

• Efficiency of various forms of red-black trees

  Brönnimann, H. & Katajainen, J., 2006.

  Research output: Working paper

• Experimental evaluation of local heaps

  Jensen, C., Katajainen, J. & Vitale, F., 2006, Department of Computer Science, University of Copenhagen, 25 p.

  Research output: Working paper

• Generic algorithm for 0-1 sorting

  Franceschini, G. & Katajainen, J., 2006.

  Research output: Working paper

• Two new methods for transforming priority queues into double-ended priority queues

  Elmasry, A., Jensen, C. & Katajainen, J., 2006, Department of Computer Science, University of Copenhagen, p. 1-14.

  Research output: Working paper

• Two-tier relaxed heaps

  Elmasry, A., Jensen, C. & Katajainen, J., 2006, Department of Computer Science, University of Copenhagen, p. 1-18.

  Research output: Working paper › Research
  2 Citations (Scopus)
• 2005

  On the power of structural violations in priority queues

  Elmasry, A., Jensen, C. & Katajainen, J., 2005, Department of Computer Science, University of Copenhagen, 18 p.

  Research output: Working paper

• Project proposal: A meldable, iterator-valid priority queue. CPH STL Report 2005-1

  Katajainen, J., 2005, 37 p.

  Research output: Working paper

• Relaxed weak queues: An alternative to run-relaxed heaps

  Elmasry, A., Jensen, C. & Katajainen, J., 2005, Department of Computer Science, University of Copenhagen, 23 p.

  Research output: Working paper

• Research proposal: Generic programming-algorithms and tools: CPH STL Report 2005-5

  Katajainen, J., 2005, 9 p.

  Research output: Working paper
• 2004

  A framework for speeding up priority-queue operations

  Elmasry, A., Jensen, C. & Katajainen, J., 2004, Department of Computer Science, University of Copenhagen, 31 p.

  Research output: Working paper
• 2003

  An extended truth about heaps

  Jensen, C., Katajainen, J. & Vitale, F., 2003, Department of Computer Science, University of Copenhagen, 16 p.

  Research output: Working paper
• 2001

  A randomized in-place algorithm for positioning the kTL element in a multiset. CPH STL Report 2001-13

  Katajainen, J. & Pasanen, T., 2001, http://www.cphstl.dk, 11 p.

  Research output: Working paper

• Experiences with the design and implementation of space-efficient deques, CPH STL Report 2001-7

  Katajainen, J. & Mortensen, B. B., 2001, http://www.cphstl.dk, 47 p.

  Research output: Working paper

• Instructions to use DIKU style files, CPH STL Report 2001-1

  Katajainen, J. & Raatikainen, K. E. E., 2001, http://www.cphstl.dk, 7 p.

  Research output: Working paper

• Research proposal: Software tools for program library development, CPH STL Report 2001-15

  Katajainen, J., 2001, http://www.cphstl.dk, 7 p.

  Research output: Working paper
• 2000

  Highly flexible nodes in external heaps

  Brodal, G. S. & Katajainen, J., 2000.

  Research output: Working paper

• Highly flexible nodes in external heaps

  Brodal, G. S. & Katajainen, J., 2000.

  Research output: Working paper

• Highly flexible nodes in external heaps

  Brodal, G. S. & Katajainen, J., 2000.

  Research output: Working paper

• Highly flexible nodes in external heaps

  Brodal, G. S. & Katajainen, J., 2000.

  Research output: Working paper

• Project proposal: The Copenhagen STL, CPH STL Report 2000-1

  Katajainen, J. & Yde, L., 2000, http://www.cphstl.dk, 5 p.

  Research output: Working paper

• Supporting Intellectual Work Through Artifact Rendering and Group Review, DIKU-rapport 00/11

  Yde, L. & Katajainen, J., 2000, Datalogisk Institut, Københavns Universitet, 14 p.

  Research output: Working paper
• 1999

  Exact Solution to Large-scale Plane Steiner Tree Problems

  Warme, D. M., Winter, P. & Zachariasen, M., 1999.

  Research output: Working paper › Research

  14 Citations (Scopus)
• 1998

  Quaternions, interpolation and animation

  Dam, E., Koch, M. & Lillholm, M., 1998, Datalogisk Institut, Københavns Universitet, 103 p. (DIKU teknisk rapport; No. 5, Vol. 98).

  Research output: Working paper › Research
• 1996

  Syntactic Properties of Polymorphic Subtyping

  Henglein, F., 1996.

  Research output: Working paper