Technical reports

The ISSN of the CPH STL report series is 1602-1150.

CPH STL reports 2018
CPH STL reports 2017
CPH STL reports 2016
CPH STL reports 2015
CPH STL reports 2014
CPH STL reports 2013
CPH STL reports 2012
CPH STL reports 2011
CPH STL reports 2010
CPH STL reports 2009
CPH STL reports 2008
CPH STL reports 2007
CPH STL reports 2006
CPH STL reports 2005
CPH STL reports 2004
CPH STL reports 2003
CPH STL reports 2002
CPH STL reports 2001
CPH STL reports 2000

CPH STL reports 2018

2018-1   Ask Neve Gamby and Jyrki Katajainen: Computing convex hulls in the plane: Collected algorithms in C++ [.pdf]

CPH STL reports 2017

2017-2   Jyrki Katajainen: Pure compile-time functions and classes in the CPH MPL [.pdf]
2017-3   Ask Neve Gamby and Jyrki Katajainen: A note on the implementation quality of a convex-hull algorithm [.pdf]

CPH STL reports 2016

2016-1   Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen: Heap-construction programs [.pdf]
2016-2   Jyrki Katajainen: Dynamic-array kernels [.pdf]

CPH STL reports 2015

2015-1   Jyrki Katajainen: All-in-one implementation framework for binary heaps [.pdf]
2015-2   Jyrki Katajainen: All-in-one implementation framework for binary heaps: Electronic appendix [.pdf]

CPH STL reports 2014

2014-1   Jyrki Katajainen: Sorting programs executing fewer branches [.pdf]

CPH STL reports 2013

2013-1   Amr Elmasry and Jyrki Katajainen: Towards ultimate binary heaps [.pdf]
2013-2   Henrik Thorup Andersen: Work-efficient B+-trees: Electronic appendix [.pdf]
2013-3   Jyrki Katajainen: Seeking for the best priority queue: Lessons learnt [.pdf]

CPH STL reports 2012

2012-1   Jyrki Katajainen: Branchless search programs: Electronic appendix [.pdf]
2012-2   Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen: A catalogue of weak-heap programs [.pdf]
2012-3   Jyrki Katajainen and Andreas Milton Maniotis: Conceptual frameworks for constructing iterators for compound data structures—Electronic appendix I: Component-iterator and rank-iterator classes [.pdf]

CPH STL reports 2011

2011-1   Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen: Adaptive heapsort: Source code [.pdf] [.ps]
2011-2   Stefan Edelkamp, Amr Elmasry, and Jyrki Katajainen: Weak-heap and weak-queue frameworks: Source code [.pdf]

CPH STL reports 2010

2010-1   Jens Peter Svensson: Doc: Dokumentationsværktøj for CPH STL [.pdf]
2010-2   Amr Elmasry and Jyrki Katajainen: Fat heaps: Source code [.pdf]
2010-3   Jens Peter Svensson: Udvidelse af Benz med eksternt domænespecifikt sprog [.pdf]
2010-4   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: Relaxed weak queues and their implementation on a pointer machine [.pdf]

CPH STL reports 2009

2009-1   Bo Simonsen: Towards stronger guarantees: Safer iterators [.pdf] [.ps]
2009-2   Claus Jensen: A note on meldable heaps relying on data-structural bootstrapping [.pdf] [.ps]
2009-3   Bo Simonsen: A framework for implementing associative containers [.pdf] [.ps]
2009-4   Jyrki Katajainen and Bo Simonsen: Vector framework: Electronic appendix [.pdf] [.ps]
2009-5   Jyrki Katajainen (Editor): Surveys on component-based development [.pdf]
2009-6   Bo Simonsen: Towards better usability of component frameworks [.pdf] [.ps]
2009-7   Jyrki Katajainen: Priority-queue frameworks: Programs [.pdf] [.ps]
2009-8   Michael Neidhardt and Bo Simonsen: Extending the CPH STL with LEDA APIs [.pdf] [.ps]

CPH STL reports 2008

2008-1   Jens Rasmussen: Implementing relaxed weak queues [.pdf] [.ps]
2008-2   Jyrki Katajainen: Mini-project: Safe standard-library containers [.pdf] [.ps]
2008-3   Claus Jensen (Editor): Surveys on software development [.pdf]
2008-4   Jyrki Katajainen (Editor): Essays on C++ concepts [.pdf]
2008-5   Cyrille Artho, Claus Jensen, and Jyrki Katajainen: Project description: Foundations and tools for building well-behaved systems [.pdf]
2008-6   Bo Simonsen: Refactoring the CPH STL: Designing an independent and generic iterator [.pdf] [.ps]

CPH STL reports 2007

2007-1   Hervé Brönnimann, Jyrki Katajainen, and Pat Morin: Putting your data structure on a diet [.pdf] [.ps]
2007-2   Lars Yde (Editor): Research proposal: Better living through computing–efficient in silico simulations of biological phenomena [.pdf]
2007-3   Jyrki Katajainen: Stronger guarantees for standard-library containers [.pdf] [.ps]
2007-4   Jyrki Katajainen: Project proposal: Associative containers with strong guarantees [.pdf] [.ps]
2007-5   Jyrki Katajainen: Making operations on standard-library containers strongly exception safe [.pdf] [.ps]

CPH STL reports 2006

2006-1   Claus Jensen, Jyrki Katajainen, and Fabio Vitale: Experimental evaluation of local heaps [.pdf] [.ps]
2006-2   Hervé Brönnimann and Jyrki Katajainen: Efficiency of various forms of red-black trees [.pdf] [.ps]
2006-3   Claus Jensen and Jyrki Katajainen: An experimental evaluation of navigation piles [.pdf] [.ps]
2006-4   Jyrki Katajainen (Editor): Project practical data structures and algorithms: Final report [.pdf]
2006-5   Gianni Franceschini and Jyrki Katajainen: Generic algorithm for 0/1-sorting [.pdf] [.ps]
2006-6   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: Two-tier relaxed heaps [.pdf] [.ps]
2006-7   Filip Bruman: Designing a generic string class for the CPH STL [.pdf] [.ps]
2006-8   Jyrki Katajainen (Editor): Proceedings of the 6th STL Workshop [.pdf]
2006-9   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: Two new methods for transforming priority queues into double-ended priority queues [.pdf] [.ps]

CPH STL reports 2005

2005-1   Jyrki Katajainen: Project proposal: A meldable, iterator-valid priority queue [.pdf] [.ps]
2005-2   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: Relaxed weak queues: An alternative to run-relaxed heaps [.pdf] [.ps]
2005-3   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: On the power of structural violations in priority queues [.pdf] [.ps]
2005-4   Anders Thøgersen and Jørgen Havsberg Seland: Linear hashing based hash tables for the CPH STL [.pdf] [.ps]
2005-5   Jyrki Katajainen: Research proposal: Generic programming — algorithms and tools [.pdf]

CPH STL reports 2004

2004-1   Stephan Lynge: Implementing the AVL-trees for the CPH STL [.pdf] [.ps]
2004-2   Mads D. Kristensen: Vector implementation for the CPH STL [.pdf] [.ps]
2004-3   Amr Elmasry, Claus Jensen, and Jyrki Katajainen: A framework for speeding up priority-queue operations [.pdf] [.ps]

CPH STL reports 2003

2003-1   Christian Ulrik Søttrup and Jakob Gregor Pedersen: CPH STL's benchmark værktøj [.pdf] [.ps]
2003-2   Jakob Sloth, Morten Lemvigh, and Mads Kristensen: Sortering i CPH STL [.pdf] [.ps]
2003-3   Andrei Josephsen: Implementation of a cache-oblivious search tree for the CPH STL [.pdf] [.ps]
2003-4   John Juul Jensen: Persistent storage framework [.pdf]
2003-5   Claus Jensen, Jyrki Katajainen, and Fabio Vitale: An extended truth about heaps [.pdf] [.ps]

CPH STL reports 2002

2002-1   Jeppe Nejsum Madsen: Algorithms for compressing and joining relations [.pdf] [.ps]
2002-2   Jesper Nielsen: CPH STL designdokumenter på webben [.pdf] [.ps]
2002-3   Claus Jensen: Webbaseret logokonkurrence [.pdf] [.ps]
2002-4   Lars Yde: Performance engineering the nth_element function [.pdf]
2002-5   Jyrki Katajainen (Editor): Project performance engineering: final report [.pdf] [.ps]
2002-6   Kristoffer Møllerhøj and Christian Ulrik Søttrup: Undersøgelse og implementation af effektiv inplace merge [.pdf] [.ps]
2002-7   Jyrki Katajainen and Fabio Vitale: Navigation piles with applications to sorting, priority queues, and priority deques [.ps]
2002-8   Jyrki Katajainen (Editor): Research proposal: Practical data structures and algorithms [.pdf] [.ps]

CPH STL reports 2001

2001-1   Jyrki Katajainen and Kimmo Raatikainen: Instructions to use DIKU style files [.pdf]
2001-2   Simon Thamdrup Jensen: Random_shuffle() in the Copenhagen STL [.pdf] [.ps]
2001-3   Brian S. Jensen: Priority queue and heap functions [.pdf] [.ps]
2001-4   Bjarke Buur Mortensen: The deque class in the Copenhagen STL: First attempt [.pdf] [.ps]
2001-5   Christian Boesgaard and Jacob Chr. Poulsen: Copenhagen STL — hash map [.pdf] [.ps]
2001-6   Jacob Gorm Hansen and Asger Kahl Henriksen: The (multi)?(map|set) of the Copenhagen STL [.ps]
2001-7   Jyrki Katajainen and Bjarke Buur Mortensen: Experiences with the design and implementation of space-efficient deques [.pdf] [.ps]
2001-8   Philip Bille: A simple implementation of set algorithms for the STL [.pdf] [.ps]
2001-9   Steffen Nissen: Permutation algorithms in the Copenhagen STL [.pdf] [.ps]
2001-10  Henrik Skovby: Implementation of a circular singly linked list: slist [.pdf] [.ps]
2001-11  Jeppe Nejsum Madsen: bitset<N> in the Copenhagen STL [.pdf] [.ps]
2001-12  Magdalena "Lenka" Otap: Webdesign for Copenhagen STL [.pdf] [.ps]
2001-13  Jyrki Katajainen and Tomi A. Pasanen: A randomized in-place algorithm for positioning the kth element in a multiset [.pdf] [.ps]
2001-14  Søren Skov and Jesper Holm Olsen: A comparative analysis of three different priority deques [.pdf] [.ps]
2001-15  Jyrki Katajainen (Editor): Research proposal: software tools for program library development [.pdf] [.ps]

CPH STL reports 2000

2000-1   Jyrki Katajainen and Lars Yde (Editors): Project proposal: the Copenhagen STL [.pdf] [.ps]
© Performance Engineering Laboratory and the CPH STL contributors, 2000–2018
Last modification: 2018-02-17