Department of Computer Science

  1. 2023
  2. Published
  3. 2022
  4. Published

    Energy Consumption-Aware Tabular Benchmarks for Neural Architecture Search

    Bakhtiarifard, Pedram, Igel, Christian & Selvan, Raghav, 12 Oct 2022, arxiv.org, 13 p.

    Research output: Working paperPreprintResearch

  5. Published
  6. Published

    Probing Pre-Trained Language Models for Cross-Cultural Differences in Values

    Arora, Arnav, Kaffee, L. F. & Augenstein, Isabelle, 2022, arxiv.org, 11 p.

    Research output: Working paperPreprintResearch

  7. 2020
  8. Published

    Imperative versus Declarative Process Mining: An Empirical Comparison

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

    Research output: Working paperResearch

  9. Published

    Understanding behaviors in videos through behavior-specific dictionaries

    Ren, H., Liu, W., Olsen, Søren Ingvor, Escalera, S. & Moeslund, T. B., 2020, Researchgate.net, 58 p.

    Research output: Working paperPreprintResearch

  10. 2009
  11. Published

    Priority-queue framework: Programs

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

    Research output: Working paperResearch

  12. Published

    Vector framework: Electronic appendix

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

    Research output: Working paperResearch

  13. Published

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

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

    Research output: Working paperResearch

  14. 2008
  15. Published

    Essays on C++ concepts

    Katajainen, J., 2008, 14 p.

    Research output: Working paperResearch

  16. Published

    Mini-project: Safe standard-library containers

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

    Research output: Working paperResearch

  17. Published

    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 paperResearch

  18. 2007
  19. Published

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

    Katajainen, J., 2007, 39 p.

    Research output: Working paperResearch

  20. Published

    Intrinsically defined sorting functions

    Henglein, Fritz, 2007.

    Research output: Working paperResearch

  21. Published

    Putting your data structure on a diet

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

    Research output: Working paperResearch

  22. 2006
  23. Published

    An experimental evaluation of navigation piles

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

    Research output: Working paperResearch

  24. Published

    Efficiency of various forms of red-black trees

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

    Research output: Working paperResearch

  25. Published

    Experimental evaluation of local heaps

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

    Research output: Working paperResearch

  26. Published

    Generic algorithm for 0-1 sorting

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

    Research output: Working paperResearch

  27. Published

    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 paperResearch

  28. Published

    Two-tier relaxed heaps

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

    Research output: Working paperResearch

  29. 2005
  30. Published

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

    Katajainen, J., 2005, 37 p.

    Research output: Working paperResearch

  31. Published

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

    Katajainen, J., 2005, 9 p.

    Research output: Working paperResearch

  32. Published

    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 paperResearch

  33. Published

    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 paperResearch

  34. 2004
  35. Published

    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 paperResearch

  36. 2003
  37. Published

    An extended truth about heaps

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

    Research output: Working paperResearch

  38. 2001
  39. Published

    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 paperResearch

  40. Published

    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 paperResearch

  41. Published

    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 paperResearch

  42. Published

    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 paperResearch

  43. 2000
  44. Published

    Highly flexible nodes in external heaps

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

    Research output: Working paperResearch

  45. Published

    Highly flexible nodes in external heaps

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

    Research output: Working paperResearch

  46. Published

    Highly flexible nodes in external heaps

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

    Research output: Working paperResearch

  47. Published

    Highly flexible nodes in external heaps

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

    Research output: Working paperResearch

  48. Published

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

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

    Research output: Working paperResearch

  49. Published

    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 paperResearch

  50. 1999
  51. Published

    Exact Solution to Large-scale Plane Steiner Tree Problems

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

    Research output: Working paperResearch

  52. 1998
  53. Published

    Quaternions, interpolation and animation

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

    Research output: Working paperResearch

  54. 1996
  55. Published

    Syntactic Properties of Polymorphic Subtyping

    Henglein, Fritz, 1996.

    Research output: Working paperResearch