Jyrki Katajainen: Publications

A. Theses

A₃	Bucketing and filtering in computational geometry more Jyrki Katajainen Ph.D. Thesis, Department of Computer Science, University of Turku (1987), vi+120 pp. (Includes C₃, C₇, C₉, C₁₀, C₁₁, C₁₂; Public discussion November 1987)
A₂	On finding minimum spanning trees (Introduction in Finnish) more Jyrki Katajainen Licentiate Thesis, Department of Computer Science, University of Turku (1983), vi+115 pp. (Includes H₁, H₂, H₄, C₂, C₄, H₅)
A₁	Tree automata and context-free languages (in Finnish) Jyrki Katajainen Master's Thesis, Department of Mathematics, University of Turku (1980), 58 pp.

B. Books

B₁	Reengineering a university department: Promoting the operational change of the computing department at the University of Copenhagen more Christopher Derek Curry and Jyrki Katajainen International Edition, Jyrki Katajainen and Company (2006), xiv+210 pp.

C. Journal papers

C₄₀	Compressing spatio-temporal trajectories more Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, and Thomas Wolle Computational Geometry—Theory and Applications 42,9 (2009), 825-841
C₃₉	Two-tier relaxed heaps more Amr Elmasry, Claus Jensen, and Jyrki Katajainen Acta Informatica 45,3 (2008), 193-210
C₃₈	Multipartite priority queues more Amr Elmasry, Claus Jensen, and Jyrki Katajainen ACM Transactions on Algorithms 5,1 (2008), Article 14
C₃₇	Two new methods for constructing double-ended priority queues from priority queues more Amr Elmasry, Claus Jensen, and Jyrki Katajainen Computing 83 (2008), 193-204
C₃₆	Space-efficient planar convex hull algorithms more Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint Theoretical Computer Science 321,1 (2004), 25-40
C₃₅	Navigation piles with applications to sorting, priority queues, and priority deques more Jyrki Katajainen and Fabio Vitale Nordic Journal of Computing 10,3 (2003), 238-262
C₃₄	Asymptotically efficient in-place merging more Viliam Geffert, Jyrki Katajainen, and Tomi A. Pasanen Theoretical Computer Science 237,1-2 (2000), 159-181
C₃₃	Performance engineering case study: Heap construction more Jesper Bojesen, Jyrki Katajainen, and Maz Spork The ACM Journal of Experimental Algorithmics 5 (2000), article 15
C₃₂	In-place sorting with fewer moves more Jyrki Katajainen and Tomi A. Pasanen Information Processing Letters 70,1 (1999), 31-37
C₃₁	Heaps and heapsort on secondary storage more Ramzi Fadel, Kim Vagn Jakobsen, Jyrki Katajainen, and Jukka Teuhola Theoretical Computer Science 220,2 (1999), 345-362
C₃₀	Characterizing multiterminal flow networks and computing flows in networks of small treewidth more Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, and Prabhakar Ragde Journal of Computer and System Sciences 57,3 (1998), 366-375
C₂₉	A reliable randomized algorithm for the closest-pair problem more Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, and Martti Penttonen Journal of Algorithms 25,1 (1997), 19-51
C₂₈	Practical in-place mergesort more Jyrki Katajainen, Tomi A. Pasanen, and Jukka Teuhola Nordic Journal of Computing 3,1 (1996), 27-40
C₂₇	Spørgsmål og svar om el-overfølsomhed more Margit Larsson and Jyrki Katajainen EBD Nyt 10 (1995)
C₂₆	Sorting multisets stably in minimum space more Jyrki Katajainen and Tomi A. Pasanen Acta Informatica 31,4 (1994), 301-313
C₂₅	Finding the maximum in parallel random access machines Yrjö Auramo, Jyrki Katajainen, and Juhani Kulmala Bulletin of the EATCS 52 (1994), 315-334
C₂₄	Space-efficient parallel merging Jyrki Katajainen, Christos Levcopoulos, and Ola Petersson Informatique Théorique et Applications 27,4 (1993), 295-310
C₂₃	An analysis of the longest match and the greedy heuristics for text encoding Jyrki Katajainen and Timo Raita Journal of the ACM 39,2 (1992), 281-294
C₂₂	Stable minimum space partitioning in linear time more Jyrki Katajainen and Tomi A. Pasanen BIT 32,4 (1992), 580-585
C₂₁	Lisää tehoa tietokoneisiin — Prosessorit yhteistyöhön more Jyrki Katajainen, Ville Leppänen, and Martti Penttonen Tiede 2000 6 (1992), 16-21 (A preliminary version of H₁₇)
C₂₀	Comparison of algorithms for standard median filtering Martti Juhola, Jyrki Katajainen, and Timo Raita IEEE Transactions on Signal Processing 39,1 (1991), 204-208
C₁₉	Maksimin määrääminen rinnakkaiskoneissa more Yrjö Auramo, Jyrki Katajainen, and Juhani Kulmala Tietojenkäsittelytiede 2 (1991), 36-48 (A preliminary version of C₂₅)
C₁₈	A note on the complexity of trie compaction Jyrki Katajainen and Erkki Mäkinen Bulletin of the EATCS 41 (1990), 212-216
C₁₇	Tree compression and optimization with applications more Jyrki Katajainen and Erkki Mäkinen International Journal of Foundations of Computer Science 1,4 (1990), 425-447
C₁₆	A sublogarithmic convex hull algorithm more Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, and Ola Petersson BIT 30,3 (1990), 378-384
C₁₅	Divide and conquer for the closest-pair problem revisited Jyrki Katajainen, Markku Koppinen, Timo Leipälä, and Olli Nevalainen International Journal on Computer Mathematics 27,3-4 (1989), 121-132
C₁₄	An approximation algorithm for space-optimal encoding of a text more Jyrki Katajainen and Timo Raita The Computer Journal 32,3 (1989), 228-237
C₁₃	Fast simulation of Turing machines by random access machines more Jyrki Katajainen, Jan van Leeuwen, and Martti Penttonen SIAM Journal on Computing 17,1 (1988), 77-88
C₁₂	Constructing Delaunay triangulations by merging buckets in quadtree order more Jyrki Katajainen and Markku Koppinen Fundamenta Informaticae XI,3 (1988), 275-288
C₁₁	The region approach for computing relative neighbourhood graphs in the L_p metric more Jyrki Katajainen Computing 40,2 (1988), 147-161
C₁₀	A linear expected-time algorithm for computing planar relative neighbourhood graphs more Jyrki Katajainen, Olli Nevalainen, and Jukka Teuhola Information Processing Letters 25,2 (1987), 77-86
C₉	An almost naive algorithm for finding relative neighbourhood graphs in L_p metrics more Jyrki Katajainen and Olli Nevalainen Informatique Théorique et Applications 21,2 (1987), 199-215
C₈	Syntax-directed compression of program files more Jyrki Katajainen, Martti Penttonen, and Jukka Teuhola Software—Practice and Experience 16,3 (1986), 269-276
C₇	Computing relative neighbourhood graphs in the plane more Jyrki Katajainen and Olli Nevalainen Pattern Recognition 19,3 (1986), 221-228
C₆	Notes on the complexity of sorting in abstract machines more Martti Penttonen and Jyrki Katajainen BIT 25,4 (1985), 611-622
C₅	NP-completeness of the Hamming salesman problem more Jarmo Ernvall, Jyrki Katajainen, and Martti Penttonen BIT 25,1 (1985), 289-292
C₄	An alternative for the implementation of Kruskal’s minimal spanning tree algorithm more Jyrki Katajainen and Olli Nevalainen Science of Computer Programming 3,2 (1983), 205-216
C₃	On the worst case of a minimal spanning tree algorithm for Euclidean space more Jyrki Katajainen BIT 23,1 (1983), 2-8
C₂	Experiments with a closest point algorithm in Hamming space more Olli Nevalainen and Jyrki Katajainen Angewandte Informatik 24,5 (1982), 277-281
C₁	Finding minimal spanning trees in a Euclidean coordinate space more Olli Nevalainen, Jarmo Ernvall, and Jyrki Katajainen BIT 21,1 (1981), 46-54

D. Conference papers

D₃₆	Adaptable component frameworks: Using `vector` from the C`++` standard library as an example more Jyrki Katajainen and Bo Simonsen Proceedings of the 2009 ACM SIGPLAN Workshop on Generic Programming, ACM (2009), 13-24
D₃₅	Stronger guarantees for standard-library containers more Jyrki Katajainen Algorithm Engineering, Oberwolfach Report 25/2007, Mathematisches Forchungsinstitut Oberwolfach (2007), 31-35
D₃₄	Making operations on standard-library containers strongly exception safe more Jyrki Katajainen Proceedings of the 3rd DIKU-IST Joint Workshop on Foundations of Software, Report 07/07, Department of Computer Science, University of Copenhagen (2007), 158-169
D₃₃	Compressing spatio-temporal trajectories more Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, and Thomas Wolle Proceedings of the 18th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 4835, Springer-Verlag (2007), 763-775 (A preliminary version of C₄₀)
D₃₂	On the power of structural violations in priority queues more Amr Elmasry, Claus Jensen, and Jyrki Katajainen Proceedings of the 13th Computing: The Australasian Theory Symposium, Conferences in Research and Practice in Information Technology 65, Australian Computer Society, Inc. (2007), 45-53
D₃₁	Two-tier relaxed heaps more Amr Elmasry, Claus Jensen, and Jyrki Katajainen Proceedings of the 17th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 4288, Springer-Verlag (2006), 308-317 (A preliminary version of C₃₉)
D₃₀	A randomized in-place algorithm for positioning the kth element in a multiset more Jyrki Katajainen and Tomi A. Pasanen Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 2368, Springer-Verlag (2002), 408-417
D₂₉	Performance tuning an algorithm for compressing relational tables more Jyrki Katajainen and Jeppe Nejsum Madsen Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 2368, Springer-Verlag (2002), 398-407
D₂₈	In-place planar convex hull algorithms more Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint Proceedings of the 5th Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science 2286, Springer-Verlag (2002), 197-205 (A preliminary version of C₃₆)
D₂₇	Experiences with the design and implementation of space-efficient deques more Jyrki Katajainen and Bjarke Buur Mortensen Proceedings of the 5th Workshop on Algorithm Engineering, Lecture Notes in Computer Science 2141, Springer-Verlag (2001), 39-50
D₂₆	Interchanging two segments of an array in a hierarchical memory system more Jesper Bojesen and Jyrki Katajainen Proceedings of the 4th International Workshop on Algorithm Engineering, Lecture Notes in Computer Science 1982, Springer-Verlag (2001), 159-170 (A longer version can be found from Jesper’s master’s thesis)
D₂₅	Performance engineering case study: Heap construction more Jesper Bojesen, Jyrki Katajainen, and Maz Spork Proceedings of the 3rd International Workshop on Algorithm Engineering, Lecture Notes in Computer Science 1668, Springer-Verlag (1999), 301-315 (A preliminary version of C₃₃)
D₂₄	The Ultimate Heapsort more Jyrki Katajainen Proceedings of the Computing: the 4th Australasian Theory Symposium, Australian Computer Science Communications 20,3, Springer-Verlag Singapore Pte. Ltd. (1998), 87-95
D₂₃	Worst-case efficient external-memory priority queues Gerth Stølting Brodal and Jyrki Katajainen Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1432, Springer-Verlag (1998), 107-118
D₂₂	A meticulous analysis of mergesort programs more Jyrki Katajainen and Jesper Larsson Träff Proceedings of the 3rd Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science 1203, Springer-Verlag (1997), 217-228
D₂₁	External heaps combined with effective buffering more Ramzi Fadel, Kim Vagn Jakobsen, Jyrki Katajainen, and Jukka Teuhola Proceedings of the Computing: the 3rd Australasian Theory Symposium, Australian Computer Science Communications 19,2, (1997), 72-78 (A preliminary version of C₃₁)
D₂₀	Finding all nearest smaller values on a distributed memory machine more Jyrki Katajainen Proceedings of the Computing: the 2nd Australasian Theory Symposium, Australian Computer Science Communications 18,3, (1996), 100-107
D₁₉	Constants in parallel sorting more Jyrki Katajainen Proceedings of the 19th Australasian Computer Science Conference, Australian Computer Science Communications 18,1, (1996), 357-366
D₁₈	Space-efficient construction of optimal prefix codes Alistair Moffat, Andrew Turpin, and Jyrki Katajainen Proceedings of the 5th IEEE Data Compression Conference, IEEE Computer Society Press (1995), 192-201
D₁₇	In-place calculation of minimum-redundacy codes more Alistair Moffat and Jyrki Katajainen Proceedings of the 4th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 955, Springer-Verlag (1995), 393-402
D₁₆	Simple parallel algorithms for the replacement edge problem and related problems on minimum spanning trees more Jyrki Katajainen and Jesper Larsson Träff Proceedings of the 18th Australasian Computer Science Conference, Australian Computer Science Communications 17,1, (1995), 254-261
D₁₅	Asymptotically efficient in-place merging more Jyrki Katajainen, Tomi A. Pasanen, and George Titan Proceedings of the 20th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 969, Springer-Verlag (1995), 211-220 (A preliminary version of C₃₄)
D₁₄	A fast and space-economical algorithm for length-limited coding more Jyrki Katajainen, Alistair Moffat, and Andrew Turpin Proceedings of the 6th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 1004, Springer-Verlag (1995), 12-21
D₁₃	Characterizations of k-terminal flow networks and computing network flows in partial k-trees Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, and Prabhakar Ragde Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM and SIAM (1995), 641-649 (A preliminary version of C₃₀)
D₁₂	Practical in-place mergesort Jyrki Katajainen, Tomi A. Pasanen, and Jukka Teuhola Proceedings of the 7th Finnish Symposium on Computer Science, Report A-1994-1, Department of Computer Science, University of Joensuu (1994), 55-62 (A preliminary version of C₂₈)
D₁₁	Efficient parallel algorithms for manipulating sorted sets more Jyrki Katajainen Proceedings of the 17th Annual Computer Science Conference, Australian Computer Science Communications 16,1, (1994), 281-288
D₁₀	On using type information in syntactical data compression Jyrki Katajainen and Erkki Mäkinen Proceedings of the 3rd Symposium on Programming Languages and Software Tools, Department of Computer Science, University of Tartu (1993), 59-65
D₉	Improved parallel bucketing algorithms for proximity problems Torben Hagerup and Jyrki Katajainen Proceedings of the 26th Annual Hawaii International Conference on System Sciences, II: Software Technology, IEEE Computer Society Press (1993), 318-327
D₈	Sorting multisets stably in minimum space more Jyrki Katajainen and Tomi A. Pasanen Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 621, Springer-Verlag (1992), 410-421 (A preliminary version of C₂₆)
D₇	Space-efficient parallel merging Jyrki Katajainen, Christos Levcopoulos, and Ola Petersson Proceedings of the 4th International PARLE Conference (Parallel Architectures and Languages Europe), Lecture Notes in Computer Science 605, Springer-Verlag (1992), 37-49 (A preliminary version of C₂₄)
D₆	In-place linear probing sort Svante Carlsson, Jyrki Katajainen, and Jukka Teuhola Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577, Springer-Verlag (1992), 581-587
D₅	Local insertion sort revisited Jyrki Katajainen, Christos Levcopoulos, and Ola Petersson Proceedings of the 2nd International Symposium on Optimal Algorithms, Lecture Notes in Computer Science 401, Springer-Verlag (1989), 239-253
D₄	An optimal expected-time parallel algorithm for Voronoi diagrams more Christos Levcopoulos, Jyrki Katajainen, and Andrzej Lingas Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer-Verlag (1988), 190-198
D₃	On the encoding of a text with a precomputed dictionary Jyrki Katajainen and Timo Raita Proceedings of the 3rd Finnish Symposium on Theoretical Computer Science, Report #15, Faculty of Mathematics and Natural Sciences, University of Joensuu (1987), 88-110 (A preliminary version of C₁₄ and C₂₃)
D₂	Syntax-directed compression of program files Jyrki Katajainen, Martti Penttonen, and Jukka Teuhola Proceedings of the 2nd Finnish Summer School on Theoretical Computer Science, Report A38, Department of Computer Science, University of Turku (1985), 60-71 (A preliminary version of C₈)
D₁	Notes on the complexity of sorting in abstract machines Martti Penttonen and Jyrki Katajainen Proceedings of the Winter School on Theoretical Computer Science, Finnish Society of Information Processing Science (1984), 206-221 (A preliminary version of C₆)

E. Conference abstracts

E₄	Putting your data structure on a diet (Abstract) more Hervé Brönnimann, Jyrki Katajainen, and Pat Morin Proceedings of the 6th STL Workshop, CPH STL Report 2006-8, Department of Computer Science, University of Copenhagen (2006), 3
E₃	Top-Down Not-Up Heapsort (Abstract) Jyrki Katajainen, Jukka Teuhola, and Tomi A. Pasanen Proceedings of the Algorithm Day in Copenhagen, Report 97/24, Department of Computer Science, University of Copenhagen (1997), 7-9
E₂	On abstract modelling of computations (Abstract) Jyrki Katajainen and Martti Penttonen Abstracts of Invited Lectures and Short Communications Delivered at the 6th International Colloquium on Numerical Analysis and Computer Science with Applications, Impulse-M (1997), 65
E₁	Algorithms for the all-nearest-neighbor problem (Abstract) Per-Olof Fjällström, Jyrki Katajainen, and Jan Petersson Abstracts of the 15th IFIP Conference on System Modelling and Optimization: Part I, International Federation for Information Processing (1991), 74-75

F. Edited publications

F₁₄	Essays on C`++` concepts more Jyrki Katajainen (Editor) CPH STL Report 2008-4, Department of Computer Science, University of Copenhagen (2008), 14 pp.
F₁₃	Proceedings of the 6th STL Workshop more Jyrki Katajainen (Editor) CPH STL Report 2006-8, Department of Computer Science, University of Copenhagen (2006), iv+52 pp.
F₁₂	Project practical data structures and algorithms: Final report more Jyrki Katajainen (Editor) CPH STL Report 2006-4, Department of Computer Science, University of Copenhagen (2006), 9 pp.
F₁₁	Proceedings of the 9th Scandinavian Workshop on Algorithm Theory Torben Hagerup and Jyrki Katajainen (Editors) Lecture Notes in Computer Science 3111, Springer-Verlag (2004), xi+506 pp.
F₁₀	Research proposal: Practical data structures and algorithms more Jyrki Katajainen (Editor) CPH STL Report 2002-8, Department of Computer Science, University of Copenhagen (2002), 6 pp.
F₉	Project performance engineering: Final report more Jyrki Katajainen (Editor) CPH STL Report 2002-5, Department of Computer Science, University of Copenhagen (2002), 11 pp.
F₈	Research proposal: Software tools for program library development more Jyrki Katajainen (Editor) CPH STL Report 2001-15, Department of Computer Science, University of Copenhagen (2001), 7 pp.
F₇	Project proposal: The Copenhagen STL more Jyrki Katajainen and Lars Yde (Editors) CPH STL Report 2000-1, Department of Computer Science, University of Copenhagen (2000), 5 pp.
F₆	Proceedings of the Algorithm Day in Copenhagen Torben Hagerup and Jyrki Katajainen (Editors) Report 97/24, Department of Computer Science, University of Copenhagen (1997), 28 pp.
F₅	Proceedings of the 2nd Copenhagen Conference on Electromagnetic Hypersensitivity more Jyrki Katajainen and Bengt Knave (Editors) Danish Association for the Electromagnetically Hypersensitive (1995)
F₄	El-overfølsomhed — problemet eksisterer, eksisterer problemet more Lis Henningsen, Else Hynne, Jyrki Katajainen, and Karin Outzen (Editors) Department of Computer Science, University of Copenhagen (1994), viii+125 pp.
F₃	Adaptiivisia lajittelualgoritmeja C`++` kielellä Jyrki Katajainen (Editor) Lecture Notes C10, Department of Computer Science, University of Turku (1990)
F₂	Proceedings of the 2nd Finnish Summer School on Theoretical Computer Science Jyrki Katajainen, Martti Penttonen, and Arto Salomaa (Editors) Report A38, Department of Computer Science, University of Turku (1985), iii+181 pp.
F₁	Systemoinnin seminaariesitelmät Jyrki Katajainen and Markku Nurminen (Editors) Lecture Notes C4, Department of Computer Science, University of Turku (1984)

G. Expository publications

G₃	Education evaluation in the Department of Computer Science at the University of Joensuu more Jyrki Katajainen Web document (2002), 19 pp.
G₂	Tietojenkäsittelyopin harjoitustöiden dokumentointiohjeet Matti Jokinen, Jyrki Katajainen, and Martti Penttonen Department of Computer Science, University of Turku (1985), 12 pp.
G₁	Datamaskinsimulering inom bangolf Jyrki Katajainen, Mauri Mäkinen, and Pia Stenmark A résumé of this report appeared in Tidningen Bangolf 1 (1982), 6

H. Technical reports

H₃₈	Vector framework: Electronic appendix more Jyrki Katajainen and Bo Simonsen CPH STL Report 2009-4, Department of Computer Science, University of Copenhagen (2009), 67 pp.
H₃₇	Priority-queue framework: Programs more Jyrki Katajainen CPH STL Report 2009-7, Department of Computer Science, University of Copenhagen (2009), 42 pp.
H₃₆	Mini-project: Safe standard-library containers more Jyrki Katajainen CPH STL Report 2008-2, Department of Computer Science, University of Copenhagen (2008), 6 pp.
H₃₅	Project description: Foundations and tools for building well-behaved systems more Cyrille Artho, Claus Jensen, and Jyrki Katajainen CPH STL Report 2008-5, Department of Computer Science, University of Copenhagen (2008), 7 pp.
H₃₄	Project proposal: Associative containers with strong guarantees more Jyrki Katajainen CPH STL Report 2007-4, Department of Computer Science, University of Copenhagen (2007), 39 pp.
H₃₃	Putting your data structure on a diet more Hervé Brönnimann, Jyrki Katajainen, and Pat Morin CPH STL Report 2007-1, Department of Computer Science, University of Copenhagen (2007), 22 pp.
H₃₂	Experimental evaluation of local heaps more Claus Jensen, Jyrki Katajainen, and Fabio Vitale CPH STL Report 2006-1, Department of Computer Science, University of Copenhagen (2006), 25 pp.
H₃₁	An experimental evaluation of navigation piles more Claus Jensen and Jyrki Katajainen CPH STL Report 2006-3, Department of Computer Science, University of Copenhagen (2006), 16 pp.
H₃₀	Generic algorithm for 0-1 sorting more Gianni Franceschini and Jyrki Katajainen CPH STL Report 2006-5, Department of Computer Science, University of Copenhagen (2006), 16 pp.
H₂₉	Efficiency of various forms of red-black trees more Hervé Brönnimann and Jyrki Katajainen CPH STL Report 2006-2, Department of Computer Science, University of Copenhagen (2006), 13 pp.
H₂₈	Research proposal: Generic programming—algorithms and tools more Jyrki Katajainen CPH STL Report 2005-5, Department of Computer Science, University of Copenhagen (2005), 9 pp.
H₂₇	Project proposal: A meldable, iterator-valid priority queue more Jyrki Katajainen CPH STL Report 2005-1, Department of Computer Science, University of Copenhagen (2005), 37 pp.
H₂₆	Relaxed weak queues: An alternative to run-relaxed heaps more Amr Elmasry, Claus Jensen, and Jyrki Katajainen CPH STL Report 2005-2, Department of Computer Science, University of Copenhagen (2005), 23 pp.
H₂₅	An extended truth about heaps more Claus Jensen, Jyrki Katajainen, and Fabio Vitale CPH STL Report 2003-5, Department of Computer Science, University of Copenhagen (2003), 16 pp.
H₂₄	Instructions to use DIKU style files more Jyrki Katajainen and Kimmo E. E. Raatikainen CPH STL Report 2001-1, Department of Computer Science, University of Copenhagen (2001), 7 pp.
H₂₃	Experiences with the design and implementation of space-efficient deques more Jyrki Katajainen and Bjarke Buur Mortensen CPH STL Report 2001-7, Department of Computer Science, University of Copenhagen (2001), 47 pp. (An extended version of D₂₇)
H₂₂	Supporting intellectual work through artifact rendering and group review more Lars Yde and Jyrki Katajainen Report 00/11, Department of Computer Science, University of Copenhagen (2000), 14 pp.
H₂₁	Worst-case efficient external-memory priority queues Gerth Stølting Brodal and Jyrki Katajainen Report 97/25, Department of Computer Science, University of Copenhagen (1997), 16 pp. (An extended version of D₂₃)
H₂₀	Experiments with universal hashing more Jyrki Katajainen and Michael Lykke Report 96/8, Department of Computer Science, University of Copenhagen (1996), 17 pp. (Presented at the 5th DIMACS Implementation Challenge, Priority Queues, Dictionaries, and Multi-Dimensional Point Sets)
H₁₉	Parallel tree slicing Jyrki Katajainen, Mikkel Thorup, and Jesper Larsson Träff Report 95/13, Department of Computer Science, University of Copenhagen (1995), 5 pp.
H₁₈	Tree slicing based on tree contraction Jyrki Katajainen, Mikkel Thorup, and Jesper Larsson Träff Report 94/30, Department of Computer Science, University of Copenhagen (1994), 9 pp.
H₁₇	More power to computers by parallel computation Jyrki Katajainen, Ville Leppänen, and Martti Penttonen Report 94/29, Department of Computer Science, University of Copenhagen (1994), 11 pp.
H₁₆	A note on the greedy method for computing relative neighbours Jyrki Katajainen and Richard B. Tan Report 93/12, Department of Computer Science, University of Copenhagen (1993), 8 pp.
H₁₅	Two theorems on the parallel construction of convex hulls Jyrki Katajainen Report 93/23, Department of Computer Science, University of Copenhagen (1993), 10 pp.
H₁₄	Algorithms for the all-nearest-neighbor problem Per-Olof Fjällström, Jyrki Katajainen, and Jan Petersson Report 92/2, Department of Computer Science, University of Copenhagen (1992), 41 pp. 5 app.pp. (A full version of E₁)
H₁₃	Rinnakkaisalgoritmit (Luvut 1-4) Yrjö Auramo, Jyrki Katajainen, and Juhani Kulmala Lecture Notes C9, Department of Computer Science, University of Turku (1990), 77 pp.
H₁₂	A Prolog prototype of a syntax-directed compression system Jyrki Katajainen, Martti Penttonen, and Jukka Teuhola Manual D31, Department of Computer Science, University of Turku (1988), 14 pp. 5 app.pp.
H₁₁	On the encoding of a text with a precomputed dictionary Jyrki Katajainen and Timo Raita Manuscript B39, Department of Computer Science, University of Turku (1986), 40 pp. (A full version of D₃)
H₁₀	Comparison of algorithms for standard median filtering Martti Juhola, Jyrki Katajainen, and Timo Raita Manuscript B44, Department of Computer Science, University of Turku (1986), 31 pp. 36 app.pp. (An extended version of C₂₀)
H₉	Three programs for computing relative neighbourhood graphs in the plane Jyrki Katajainen and Olli Nevalainen Manual D29, Department of Computer Science, University of Turku (1985), 4 pp. 16 app.pp.
H₈	A note on systems of finite sets satisfying an intersection condition Jyrki Katajainen and Markku Koppinen Manuscript B36, Department of Computer Science, University of Turku (1985), 10 pp.
H₇	On the relationship between minimum matchings and Delaunay graphs in the L_p-metric Jyrki Katajainen Report A42, Department of Computer Science, University of Turku (1985), 10 pp.
H₆	Some programs for finding the minimal spanning forest of a graph Jyrki Katajainen Manual D28, Department of Computer Science, University of Turku (1984), 2 pp. 16 app.pp.
H₅	An implementation of Cheriton-Tarjan’s minimal spanning tree algorithm using ordered subsets Jyrki Katajainen Report A35, Department of Computer Science, University of Turku (1983), 10 pp. 10 app.pp.
H₄	On the worst case of a minimal spanning tree algorithm for Euclidean space more Jyrki Katajainen Report A34, Department of Computer Science, University of Turku (1982) (A preliminary version of C₃)
H₃	Simulointi Jyrki Katajainen Lecture Notes, Department of Computer Science, University of Turku (1982), 81 pp.
H₂	An implementation of an algorithm for finding minimal spanning trees in a Euclidean coordinate space more Jyrki Katajainen Manual D22, Department of Computer Science, University of Turku (1981), 6 pp. 10 app.pp.
H₁	A minimal spanning tree algorithm for a point set in Euclidean space more Jarmo Ernvall, Jyrki Katajainen, and Olli Nevalainen Report A28, Department of Computer Science, University of Turku (1980) (A preliminary version of C₁)

I. Unpublished manuscripts

I₄	Reengineering a university department: Promoting the operational change of the computing department at the University of Copenhagen more Christopher Derek Curry and Jyrki Katajainen Limited Edition, Master’s Thesis, Department of Computer Science, University of Copenhagen (2003), xiv+182 pp. (A preliminary version of B₁)
I₃	Highly flexible nodes in external heaps Gerth Stølting Brodal and Jyrki Katajainen Unpublished typescript (2000)
I₂	On stable quicksort Jyrki Katajainen and Jesper Larsson Träff Unfinished draft (1997)
I₁	Subtraktion i skolor Jyrki Katajainen, Max Stenmark, and Mickel Stenmark Unpublished manuscript (1996)

This page was generated by Jyrki Katajainen <jyrki@diku.dk> on 08.10.2009.