|
|
Slide presentations
|
15.11.2012
Jyrki Katajainen,
In-place data structures: Which complexity measures do matter?
[.pdf]
|
|
23.10.2012
Jyrki Katajainen,
Improved address-calculation coding of integer arrays
[.pdf]
|
|
19.07.2012
Amr Elmasry,
A catalogue of algorithms for building weak heaps
[.pdf]
|
|
08.06.2012
Jyrki Katajainen,
Branch mispredictions don't affect mergesort
[.pdf]
|
|
04.06.2012
Jyrki Katajainen,
Lean programs, branch mispredictions, and sorting
[.pdf]
|
|
02.02.2012
Jyrki Katajainen,
The weak-heap family of priority queues in theory and praxis
[.pdf]
|
|
21.06.2011
Jyrki Katajainen,
Two constant-factor-optimal realizations of adaptive heapsort
[.pdf]
|
|
05.04.2011
Jyrki Katajainen,
Two number systems and one application
[.pdf]
|
|
21.06.2010
Jyrki Katajainen,
Strictly-regular number system and data structures
[.pdf]
|
|
22.05.2010
Stefan Edelkamp,
Policy-based benchmarking of weak heaps and their relatives
[.pdf] [.pptx]
|
|
06.05.2010
Jyrki Katajainen,
Numeral systems & data structures
[.pdf]
|
|
30.08.2009
Bo Simonsen,
Adaptable component frameworks: Using vector from the C++ standard library as an example
[.pdf]
|
|
11.05.2009
Jyrki Katajainen,
Is the CPH STL an active library?
[.pdf]
|
|
16.01.2009
Jyrki Katajainen,
Comparison complexity of priority-queue operations
[.pdf]
|
|
01.09.2008
Søren Christiansen,
Binomial heap with guaranteed strong exception safety and optimal running time
[.pdf]
|
|
08.04.2008
Johannes Serup,
Test af hashtabelmodul
[.pdf]
|
|
06.10.2007
Jyrki Katajainen,
Making operations on standard-library containers strongly exception safe
[.pdf]
|
|
08.05.2007
Jyrki Katajainen,
Stronger guarantees for standard-library containers
[.pdf]
|
|
06.02.2007
Jyrki Katajainen,
Putting your data structure on a diet
[.pdf]
|
|
01.02.2007
Jyrki Katajainen,
On the power of structural violations in priority queues
[.pdf]
|
|
19.12.2006
Claus Jensen,
Two-tier relaxed heaps
[.pdf] [.ppt]
|
|
30.10.2006
Kasper Egdø,
Iterators for the trie data structure
[.pdf] [.ps]
|
|
27.06.2006
Bo Bendtsen and Lasse Laursen,
Mini-project on binomial heaps
[.pdf]
|
|
27.06.2006
Dirk Hasselbalch and Sune Sloth Simonsen,
En forbedret prioritetskø baseret på en binomial hob
[.pdf]
|
|
21.06.2005
Claus Jensen,
An experimental study of priority queues
[.pdf] [.ppt]
|
|
21.06.2005
John Juul Jensen,
Optimization of allocators for POD-types
[.pdf] [.ppt]
|
|
21.06.2005
Jyrki Katajainen,
Relaxed weak queues: an alternative to run-relaxed heaps
[.pdf] [.ps]
|
|
21.06.2005
Jørgen Havsberg Seland,
Hashtables based on linear hashing --- Design
[.pdf] [.ps]
|
|
21.06.2005
Anders Thøgersen,
Hashtables based on linear hashing --- Benchmarks
[.pdf]
|
|
20.01.2005
Jyrki Katajainen,
Anatomy of a worst-case efficient priority queue
[.pdf] [.ps]
|
|
05.07.2004
Claus Jensen,
Experimental study of navigation piles
[.pdf] [.ppt]
|
|
12.05.2004
Jyrki Katajainen,
The cost of iterator validity
[.ps]
|
|
08.12.2003
Jyrki Katajainen,
The current truth about heaps
[.pdf]
|
|
26.05.2003
Claus Jensen,
Multi-vejs hobe med ekstra bytes
[.pdf] [.ppt]
|
|
26.05.2003
Jyrki Katajainen,
The first four months of our benchmark tool
[.pdf] [.ps]
|
|
26.05.2003
Fabio Vitale,
Navigation piles with applications to sorting, priority queues, and priority deques
[.pdf] [.ppt]
|
|
24.03.2003
Hervé Brönnimann,
Experiments with binary search trees and linear-time sorting
[.htm]
|
|
05.02.2003
Jyrki Katajainen,
Bachelor-project proposals
[.pdf] [.ps]
|
|
11.11.2002
Jesper Holm Olsen,
Distribution heap: a cache-oblivious priority queue
[.pdf] [.ps]
|
|
11.11.2002
Søren Christian Skov,
Funnel heap: a cache-oblivious priority queue
[.pdf] [.ps]
|
|
21.10.2002
Frederik Rønn,
Cache-oblivious algorithms and data structures
[.pdf]
|
|
05.07.2002
Jyrki Katajainen,
A randomized in-place algorithm for positioning the k th element in a multiset
[.pdf]
|
|
05.07.2002
Jeppe Nejsum Madsen,
Performance tuning an algorithm for compressing relational tables
[.pdf]
|
|
13.06.2002
Jyrki Katajainen,
Software tools for program library development
[.pdf]
|
|
15.04.2002
Jyrki Katajainen,
A randomized in-place algorithm for positioning the k th element in a multiset
[.pdf]
|
|
06.02.2002
Jyrki Katajainen,
Bachelor-project proposals
[.pdf] [.ps]
|
|
17.12.2001
Jyrki Katajainen,
New CPH STL headers <compile-time-assert> and <type>
[.pdf] [.ps]
|
|
17.12.2001
Jesper Holm Olsen,
A comparative analysis of three different priority deques
[.pdf] [.ps]
|
|
17.12.2001
Jørgen Villadsen,
The status of stable quicksort
[.pdf]
|
|
28.08.2001
Bjarke Buur Mortensen,
Experiences with the design and implementation of space-efficient deques
[.pdf] [.ps]
|
|
11.06.2001
Jyrki Katajainen,
Space-efficient vectors and deques
[.pdf] [.ps]
|
|
23.04.2001
Philip Bille,
A simple implementation of set algorithms for the STL
[.ps]
|
|
23.04.2001
Jyrki Katajainen,
Status of the CPH STL project
[.pdf] [.ps]
|
|
23.04.2001
Bjarke Buur Mortensen,
Experiences with the design and implementation of space-efficient deques
[.ps]
|
|
23.10.2000
Jyrki Katajainen,
Automating the efficiency comparison of programs
[.pdf] [.ps]
|
|
02.10.2000
Allan Beaufour Larsen,
Documentation tools
[.ps]
|
|
25.09.2000
Søren Debois,
C++ standard
[.ps]
|
|
18.09.2000
Jacob Gorm Hansen,
Introduktion til CVS
[.ps]
|
|
