Jyrki Katajainen: Presentations

2016

 •  Worst-case-efficient dynamic arrays in practice  more
Jyrki Katajainen
Algorithmic Research Cooperation around {Ø|Ö}resund, Odense, 04 Apr. 2016, 21 pp.

2015

 •  Adjustable navigation pile  more
Jyrki Katajainen (joint work with Tetsuo Asano, Omar Darwish, Amr Elmasry, and Fabio Vitale)
Algorithmic Research Cooperation around {Ø|Ö}resund, Lyngby, 20 Nov. 2015, 16 pp.

2014

 •  What your teachers never told you about Fibonacci heaps  more
Jyrki Katajainen (joint work with Stefan Edelkamp and Jesper Larsson Träff)
Algorithmic Research Cooperation around {Ø|Ö}resund, Copenhagen, 14 Nov. 2014, 23 pp.

2013

 •  Seeking for the best priority queue: Lessons learnt  more
Jyrki Katajainen
Algorithm Engineering (Seminar 13391), Schloss Dagstuhl---Leibniz-Zentrum für Informatik, Dagstuhl, 23 Sept. 2013, 31 pp.
 •  In-place binary counters  more
Jyrki Katajainen (joint work with Amr Elmasry)
38th International Symposium on Mathematical Foundations of Computer Science, Klosterneuburg, 26 Aug. 2013, 17 pp.
 •  Weak heaps and friends: Recent developments  more
Jyrki Katajainen (joint work with Stefan Edelkamp, Amr Elmasry, and Armin Weiß)
Vienna University of Technology, Vienna, 23 Aug. 2013, 49 pp.
 •  Branchless search programs  more
Jyrki Katajainen (joint work with Amr Elmasry)
12th International Symposium on Experimental Algorithms, Rome, 07 June 2013, 17 pp.
 •  Priority queues and sorting for read-only data  more
Jyrki Katajainen (joint work with Tetsuo Asano and Amr Elmasry)
10th Annual Conference on Theory and Applications of Models of Computation, Hong Kong, 20 May 2013, 16 pp.
 •  Towards ultimate binary heaps  more
Jyrki Katajainen (joint work with Amr Elmasry)
Algorithmic Research Cooperation around {Ø|Ö}resund, Odense, 05 Apr. 2013, 14 pp.

2012

 •  In-place data structures: Which complexity measures do matter?  more
Jyrki Katajainen (joint work with Jingsen Chen, Stefan Edelkamp, Amr Elmasry, and Max Stenmark)
Algorithmic Research Cooperation around {Ø|Ö}resund, Copenhagen, 15 Nov. 2012, 25 pp.
 •  Improved address-calculation coding of integer arrays  more
Jyrki Katajainen (joint work with Amr Elmasry and Jukka Teuhola)
19th International Symposium on String Processing and Information Retrieval, Cartagena de Indias, 23 Oct. 2012, 14 pp.
 •  Branch mispredictions don’t affect mergesort  more
Jyrki Katajainen (joint work with Amr Elmasry and Max Stenmark)
11th International Symposium on Experimental Algorithms, Bordeaux, 08 June 2012, 19 pp.
 •  Lean programs, branch mispredictions, and sorting  more
Jyrki Katajainen (joint work with Amr Elmasry)
6th Conference on Fun with Algorithms, Venice, 04 June 2012, 16 pp.
 •  The weak-heap family of priority queues in theory and praxis  more
Jyrki Katajainen (joint work with Stefan Edelkamp and Amr Elmasry)
18th Computing: The Australasian Theory Symposium, Melbourne, 02 Feb. 2012, 14 pp.
 •  Strategies to success in scientific work  more
Jyrki Katajainen
Australasian Computing Doctoral Consortium, Melbourne, 30 Jan. 2012, 23 pp.

2011

 •  Two constant-factor-optimal realizations of adaptive heapsort  more
Jyrki Katajainen (joint work with Stefan Edelkamp and Amr Elmasry)
22nd International Workshop on Combinatorial Algorithms, Victoria, 21 June 2011, 20 pp.
 •  Two minutes of myself  more
Jyrki Katajainen
Graph Drawing with Algorithm Engineering Methods (Seminar 11191), Schloss Dagstuhl---Leibniz-Zentrum für Informatik, Wadern, 09 May 2011, 2 pp.
 •  Two number systems and one application  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
Algorithmic Research Cooperation around {Ø|Ö}resund, Malmö, 05 Apr. 2011, 16 pp.

2010

 •  Strictly-regular number system and data structures  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, 21 June 2010, 15 pp.
 •  Numeral systems & data structures  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
Department of Computer Science, University of Copenhagen, Copenhagen, 06 May 2010, 12 pp.

2009

 •  Is the CPH STL an active library?  more
Jyrki Katajainen (joint work with Bo Simonsen)
Centre for Internationalization & Parallel Language Use, University of Copenhagen, Copenhagen, 11 May 2009, 11 pp.
 •  Comparison complexity of priority-queue operations  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
Max-Planck-Institut für Informatik, Saarbrücken, 16 Jan. 2009, 21 pp.

2008

 •  Golden advice from the handbook  more
Jyrki Katajainen
Seminar on Strategic Priorities, Department of Computer Science, University of Copenhagen, Copenhagen, 19 Nov. 2008, 21 pp.

2007

 •  Making operations on standard-library containers strongly exception safe  more
Jyrki Katajainen
3rd DIKU-IST Joint Workshop on Foundations of Software, Copenhagen, 06 Oct. 2007, 16 pp.
 •  Stronger guarantees for standard-library containers  more
Jyrki Katajainen
Algorithm Engineering (Workshop 0719), Mathematisches Forchungsinstitut Oberwolfach, Oberwolfach-Walke, 08 May 2007, 21 pp.
 •  Putting your data structure on a diet  more
Jyrki Katajainen (joint work with Hervé Brönnimann and Pat Morin)
University of Melbourne and University of Sydney, Oberwolfach-Walke, 06 Feb. 2007, 14 Feb. 2007, 28 pp.
 •  On the power of structural violations in priority queues  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
13th Computing: The Australasian Theory Symposium, Ballarat, 01 Feb. 2007, 21 pp.

2005

 •  Relaxed weak queues: An alternative to run-relaxed heaps  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
5th STL Workshop, Department of Computer Science, University of Copenhagen, Copenhagen, 21 June 2005, 22 pp.

2004

 •  Anatomy of a worst-case efficient priority queue  more
Jyrki Katajainen (joint work with Amr Elmasry and Claus Jensen)
25th Anniversary on the Stage as a University Teacher, Several computer-science departments in the Nordic countries, Copenhagen, Joensuu, Kuopio, Turku, Helsinki, Lund, Linköping, Oct. 2004 -- Jan. 2005, 28 pp.
 •  The cost of iterator validity  more
Jyrki Katajainen
Chalmers University of Technology, Göteborg, 12 May 2004, 25 pp.

2003

 •  The current truth about heaps  more
Jyrki Katajainen (joint work with Claus Jensen and Fabio Vitale)
University of Helsinki, Helsinki, 08 Dec. 2003, 30 pp.
 •  The first four months of our benchmark tool  more
Jyrki Katajainen
4th STL Workshop, Department of Computer Science, University of Copenhagen, Copenhagen, 26 May 2003, 16 pp.

2002

 •  A randomized in-place algorithm for positioning the kth element in a multiset  more
Jyrki Katajainen (joint work with Tomi A. Pasanen)
8th Scandinavian Workshop on Algorithm Theory, Turku, 05 July 2002, 16 pp.
 •  Software tools for program library development  more
Jyrki Katajainen
Dansk Selskab for Datalogi, Copenhagen, 13 June 2002, 56 pp.
 •  In-place planar convex hull algorithms  more
Jyrki Katajainen (joint work with Hervé Brönnimann, John Iacono, Pat Morin, Jason Morrison, and Godfried Toussaint)
Algorithmic Research Cooperation around {Ø|Ö}resund, Copenhagen, 14 Jan. 2002, 15 pp.

2001

 •  New CPH STL headers <compile-time-assert> and <type>  more
Jyrki Katajainen
3rd STL Workshop, Department of Computer Science, University of Copenhagen, Copenhagen, 17 Dec. 2001, 19 pp.
 •  Sequence comparison  more
Jyrki Katajainen
Stockholm University, Stockholm, 26 Oct. 2001, 14 pp.
 •  Space-efficient vectors and deques  more
Jyrki Katajainen (joint work with Bjarke Buur Mortensen)
Chalmers University of Technology, Göteborg, 11 June 2001, 13 pp.
 •  Teaching process reengineering  more
Christopher Derek Curry and Jyrki Katajainen
Tietojenkäsittelytieteen päivät, Turku, 21 May 2001, 44 pp.
 •  Status of the CPH STL project  more
Jyrki Katajainen
2nd STL Workshop, Department of Computer Science, University of Copenhagen, Copenhagen, 23 Apr. 2001, 12 pp.

2000

 •  Automating the efficiency comparison of programs  more
Jyrki Katajainen
1st STL Workshop, Department of Computer Science, University of Copenhagen, Copenhagen, 23 Oct. 2000, 17 pp.
 •  Methodological issues in algorithm experimentation: A case study of heaps  more
Jyrki Katajainen (joint work with Jesper Bojesen)
Algorithmic Research Cooperation around {Ø|Ö}resund, Copenhagen, 26 May 2000, 17 pp.

1999

 •  Performance engineering case study: Heap construction  more
Jyrki Katajainen (joint work with Jesper Bojesen and Maz Spork)
3rd International Workshop on Algorithm Engineering, London, 21 July 1999, 18 pp.
This page was generated by Jyrki Katajainen <jyrki@di.ku.dk> on 15.05.2017.