Jyrki Katajainen

Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti: Selection from Read-Only Memory with Limited Workspace. COCOON 2013: 147-157

Tetsuo Asano, Amr Elmasry, Jyrki Katajainen: Priority Queues and Sorting for Read-Only Data. TAMC 2013: 32-41

Amr Elmasry, Jyrki Katajainen: Branchless Search Programs. SEA 2013: 127-138

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16: 187-205 (2012)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50(1): 185-211 (2012)

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112

Amr Elmasry, Jyrki Katajainen: Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR 2012: 125-137

Amr Elmasry, Jyrki Katajainen: Lean Programs, Branch Mispredictions, and Sorting. FUN 2012: 119-130

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: A Catalogue of Algorithms for Building Weak Heaps. IWOCA 2012: 249-262

Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270

Amr Elmasry, Jyrki Katajainen, Jukka Teuhola: Improved Address-Calculation Coding of Integer Arrays. SPIRE 2012: 205-216

Amr Elmasry, Jyrki Katajainen: Fat Heaps without Regular Counters. WALCOM 2012: 173-185

Amr Elmasry, Jyrki Katajainen, Max Stenmark: Branch Mispredictions Don't Affect Mergesort. SEA 2012: 160-171

Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow: The Open Graph Archive: A Community-Driven Effort. Graph Drawing 2011: 435-440

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208

Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow: The Open Graph Archive: A Community-Driven Effort. CoRR abs/1109.1465 (2011)

Amr Elmasry, Jyrki Katajainen: Worst-Case Optimal Priority Queues via Extended Regular Counters. CoRR abs/1112.0993 (2011)

Jyrki Katajainen, S. Srinivasa Rao: A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23): 1061-1066 (2010)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: The Magic of a Number System. FUN 2010: 156-165

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Strictly-Regular Number System and Data Structures. SWAT 2010: 26-37

Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen: Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA 2010: 424-435

Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two-tier relaxed heaps. Acta Inf. 45(3): 193-210 (2008)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two new methods for constructing double-ended priority queues from priority queues. Computing 83(4): 193-204 (2008)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Multipartite priority queues. ACM Transactions on Algorithms 5(1) (2008)

Amr Elmasry, Claus Jensen, Jyrki Katajainen: On the Power of Structural Violations in Priority Queues. CATS 2007: 45-53

Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775

Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two-Tier Relaxed Heaps. ISAAC 2006: 308-317

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004)

Torben Hagerup, Jyrki Katajainen (Eds.): Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science 3111, Springer 2004, isbn 3-540-22339-8

Jyrki Katajainen, Fabio Vitale: Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques. Nord. J. Comput. 10(3): 238- (2003)

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507

Jyrki Katajainen, Jeppe Nejsum Madsen: Performance Tuning an Algorithm for Compressing Relational Tables. SWAT 2002: 398-407

Jyrki Katajainen, Tomi Pasanen: A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. SWAT 2002: 408-417

Jyrki Katajainen, Bjarke Buur Mortensen: Experiences with the Design and Implementation of Space-Efficient Deques. Algorithm Engineering 2001: 39-50

Jesper Bojesen, Jyrki Katajainen, Maz Spork: Performance Engineering Case Study: Heap Construction. ACM Journal of Experimental Algorithmics 5: 15 (2000)

Viliam Geffert, Jyrki Katajainen, Tomi Pasanen: Asymptotically efficient in-place merging. Theor. Comput. Sci. 237(1-2): 159-181 (2000)

Jesper Bojesen, Jyrki Katajainen: Interchanging Two Segments of an Array in a Hierarchical Memory System. Algorithm Engineering 2000: 159-170

Jyrki Katajainen, Tomi Pasanen: In-Place Sorting with Fewer Moves. Inf. Process. Lett. 70(1): 31-37 (1999)

R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola: Heaps and Heapsort on Secondary Storage. Theor. Comput. Sci. 220(2): 345-362 (1999)

Jesper Bojesen, Jyrki Katajainen, Maz Spork: Performance Engineering Case Study: Heap Construction. Algorithm Engineering 1999: 302-316

Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57(3): 366-375 (1998)

Jyrki Katajainen: The Ultimate Heapsort. CATS 1998: 87-96

Gerth Stølting Brodal, Jyrki Katajainen: Worst-Case External-Memory Priority Queues. SWAT 1998: 107-118

Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen: A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997)

Jyrki Katajainen, Jesper Larsson Träff: A Meticulous Analysis of Mergesort Programs. CIAC 1997: 217-228

Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola: Practical In-Place Mergesort. Nord. J. Comput. 3(1): 27-40 (1996)

Alistair Moffat, Andrew Turpin, Jyrki Katajainen: Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995: 192-201

Jyrki Katajainen, Alistair Moffat, Andrew Turpin: A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995: 12-21

Jyrki Katajainen, Tomi Pasanen, George Titan: Asymptotically Efficient In-Place Merging. MFCS 1995: 211-220

Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649

Alistair Moffat, Jyrki Katajainen: In-Place Calculation of Minimum-Redundancy Codes. WADS 1995: 393-402

Jyrki Katajainen, Tomi Pasanen: Sorting Multisets Stably in Minimum Space. Acta Inf. 31(4): 301-313 (1994)

Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. ITA 27(4): 295-310 (1993)

Jyrki Katajainen, Tomi Pasanen: Stable Minimum Space Partitioning in Linear Time. BIT 32(4): 580-585 (1992)

Jyrki Katajainen, Timo Raita: An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992)

Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. PARLE 1992: 37-49

Svante Carlsson, Jyrki Katajainen, Jukka Teuhola: In-place Linear Probing Sort. STACS 1992: 581-587

Jyrki Katajainen, Tomi Pasanen: Sorting Multisets Stably in Minimum Space. SWAT 1992: 410-421

Martti Juhola, Jyrki Katajainen, Timo Raita: Comparison of algorithms for standard median filtering. IEEE Transactions on Signal Processing 39(1): 204-208 (1991)

Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990)

Jyrki Katajainen, Erkki Mäkinen: A note on the complexity of trie compaction. Bulletin of the EATCS 41: 212-216 (1990)

Jyrki Katajainen, Erkki Mäkinen: Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1(4): 425-448 (1990)

Jyrki Katajainen, Timo Raita: An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32(3): 228-237 (1989)

Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253

Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen: Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988)

Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas: An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198

Jyrki Katajainen, Olli Nevalainen, Jukka Teuhola: A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. Inf. Process. Lett. 25(2): 77-86 (1987)

Jyrki Katajainen, Olli Nevalainen: An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in L_p Metrics. ITA 21(2): 199-215 (1987)

Jyrki Katajainen, Olli Nevalainen: Computing relative neighbourhood graphs in the plane. Pattern Recognition 19(3): 221-228 (1986)

Jyrki Katajainen, Martti Penttonen, Jukka Teuhola: Syntax-directed Compression of Program Files. Softw., Pract. Exper. 16(3): 269-276 (1986)

Martti Penttonen, Jyrki Katajainen: Notes on the Complexity of Sorting in Abstract Machines. BIT 25(4): 611-622 (1985)

Jyrki Katajainen: On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. BIT 23(1): 2-8 (1983)

Jyrki Katajainen, Olli Nevalainen: An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. Sci. Comput. Program. 3(2): 205-216 (1983)

Olli Nevalainen, Jyrki Katajainen: Experiments with a Closest Point Algorithm in Hamming Space. Angewandte Informatik 24(5): 277-281 (1982)

Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen: Finding Minimal Spanning Trees in a Euclidean Coordinate Space. BIT 21(1): 46-54 (1981)