Finding Minimal Spanning Trees in a Euclidean Coordinate Space. - Olli Nevalainen; Jarmo Ernvall; Jyrki Katajainen (BIT, 1981)

Experiments with a Closest Point Algorithm in Hamming Space. - Olli Nevalainen; Jyrki Katajainen (Angew. Inform., 1982)

On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. - Jyrki Katajainen (BIT, 1983)

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

Notes on the Complexity of Sorting in Abstract Machines. - Martti Penttonen; Jyrki Katajainen (BIT, 1985)

Computing relative neighbourhood graphs in the plane. - Jyrki Katajainen; Olli Nevalainen (Pattern Recognit., 1986)

Syntax-directed Compression of Program Files. - Jyrki Katajainen; Martti Penttonen; Jukka Teuhola (Softw. Pract. Exp., 1986)

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

An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in Lp Metrics. - Jyrki Katajainen; Olli Nevalainen (RAIRO Theor. Informatics Appl., 1987)

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. - Christos Levcopoulos; Jyrki Katajainen; Andrzej Lingas (SWAT, 1988)

The region approach for computing relative neighbourhood graphs in the Lp metric. - Jyrki Katajainen (Computing, 1988)

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

Local Insertion Sort Revisited. - Jyrki Katajainen; Christos Levcopoulos; Ola Petersson (Optimal Algorithms, 1989)

An Approximation Algorithm for Space-Optimal Encoding of a Text. - Jyrki Katajainen; Timo Raita (Comput. J., 1989)

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

A note on the complexity of trie compaction. - Jyrki Katajainen; Erkki Mäkinen (Bull. EATCS, 1990)

Tree Compression and Optimization with Applications. - Jyrki Katajainen; Erkki Mäkinen (Int. J. Found. Comput. Sci., 1990)

Comparison of algorithms for standard median filtering. - Martti Juhola; Jyrki Katajainen; Timo Raita (IEEE Trans. Signal Process., 1991)

In-place Linear Probing Sort. - Svante Carlsson; Jyrki Katajainen; Jukka Teuhola (STACS, 1992)

Stable Minimum Space Partitioning in Linear Time. - Jyrki Katajainen; Tomi Pasanen (BIT, 1992)

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

Space-Efficient Parallel Merging. - Jyrki Katajainen; Christos Levcopoulos; Ola Petersson (RAIRO Theor. Informatics Appl., 1993)

Sorting Multisets Stably in Minimum Space. - Jyrki Katajainen; Tomi Pasanen (Acta Informatica, 1994)

Space-Efficient Construction of Optimal Prefix Codes. - Alistair Moffat; Andrew Turpin; Jyrki Katajainen (Data Compression Conference, 1995)

A Fast and Space - Economical Algorithm for Length - Limited Coding. - Jyrki Katajainen; Alistair Moffat; Andrew Turpin (ISAAC, 1995)

Asymptotically Efficient In-Place Merging. - Jyrki Katajainen; Tomi Pasanen; George Titan (MFCS, 1995)

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

In-Place Calculation of Minimum-Redundancy Codes. - Alistair Moffat; Jyrki Katajainen (WADS, 1995)

Practical In-Place Mergesort. - Jyrki Katajainen; Tomi Pasanen; Jukka Teuhola (Nord. J. Comput., 1996)

A Meticulous Analysis of Mergesort Programs. - Jyrki Katajainen; Jesper Larsson Träff (CIAC, 1997)

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

The Ultimate Heapsort. - Jyrki Katajainen (CATS, 1998)

Worst-Case External-Memory Priority Queues. - Gerth Stølting Brodal; Jyrki Katajainen (SWAT, 1998)

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

In-Place Sorting with Fewer Moves. - Jyrki Katajainen; Tomi Pasanen (Inf. Process. Lett., 1999)

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

Interchanging Two Segments of an Array in a Hierarchical Memory System. - Jesper Bojesen; Jyrki Katajainen (WAE, 2000)

Performance Engineering Case Study: Heap Construction. - Jesper Bojesen; Jyrki Katajainen; Maz Spork (ACM J. Exp. Algorithmics, 2000)

Asymptotically efficient in-place merging. - Viliam Geffert; Jyrki Katajainen; Tomi Pasanen (Theor. Comput. Sci., 2000)

Experiences with the Design and Implementation of Space-Efficient Deques. - Jyrki Katajainen; Bjarke Buur Mortensen (WAE, 2001)

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

Performance Tuning an Algorithm for Compressing Relational Tables. - Jyrki Katajainen; Jeppe Nejsum Madsen (SWAT, 2002)

A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. - Jyrki Katajainen; Tomi Pasanen (SWAT, 2002)

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

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

On the Power of Structural Violations in Priority Queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (CATS, 2007)

Two-tier relaxed heaps. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Acta Informatica, 2008)

Two new methods for constructing double-ended priority queues from priority queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Computing, 2008)

Multipartite priority queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (ACM Trans. Algorithms, 2008)

Adaptable component frameworks: using vector from the C++ standard library as an example. - Jyrki Katajainen; Bo Simonsen (WGP@ICFP, 2009)

Compressing spatio-temporal trajectories. - Joachim Gudmundsson; Jyrki Katajainen; Damian Merrick; Cahya Ong; Thomas Wolle (Comput. Geom., 2009)

The Magic of a Number System. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (FUN, 2010)

Strictly-Regular Number System and Data Structures. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (SWAT, 2010)

Policy-Based Benchmarking of Weak Heaps and Their Relatives, . - Asger Bruun; Stefan Edelkamp; Jyrki Katajainen; Jens Rasmussen (SEA, 2010)

A compact data structure for representing a dynamic multiset. - Jyrki Katajainen; S. Srinivasa Rao 001 (Inf. Process. Lett., 2010)

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

Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (IWOCA, 2011)

The Weak-Heap Family of Priority Queues in Theory and Praxis. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (CATS, 2012)

Worst-Case Optimal Priority Queues via Extended Regular Counters. - Amr Elmasry; Jyrki Katajainen (CSR, 2012)

Lean Programs, Branch Mispredictions, and Sorting. - Amr Elmasry; Jyrki Katajainen (FUN, 2012)

A Catalogue of Algorithms for Building Weak Heaps. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (IWOCA, 2012)

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

Improved Address-Calculation Coding of Integer Arrays. - Amr Elmasry; Jyrki Katajainen; Jukka Teuhola (SPIRE, 2012)

Branch Mispredictions Don't Affect Mergesort. - Amr Elmasry; Jyrki Katajainen; Max Stenmark (SEA, 2012)

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

Two Skew-Binary Numeral Systems and One Application. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Theory Comput. Syst., 2012)

Weak Heaps and Friends: Recent Developments. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen; Armin Weiß (IWOCA, 2013)

In-Place Binary Counters. - Amr Elmasry; Jyrki Katajainen (MFCS, 2013)

Priority Queues and Sorting for Read-Only Data. - Tetsuo Asano; Amr Elmasry; Jyrki Katajainen (TAMC, 2013)

Branchless Search Programs. - Amr Elmasry; Jyrki Katajainen (SEA, 2013)

Fat Heaps without Regular Counters. - Amr Elmasry; Jyrki Katajainen (Discret. Math. Algorithms Appl., 2013)

Weak heaps engineered. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (J. Discrete Algorithms, 2013)

Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. - Stefan Edelkamp; Jyrki Katajainen; Amr Elmasry (CoRR, 2014)

Selection from read-only memory with limited workspace. - Amr Elmasry; Daniel Dahl Juhl; Jyrki Katajainen; Srinivasa Rao Satti (Theor. Comput. Sci., 2014)

An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (CSR, 2015)

Worst-Case-Efficient Dynamic Arrays in Practice. - Jyrki Katajainen (SEA, 2016)

Editorial, SEA 2014 Special Issue. - Joachim Gudmundsson; Jyrki Katajainen (ACM J. Exp. Algorithmics, 2016)

Heap Construction - 50 Years Later. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (Comput. J., 2017)

Bipartite binomial heaps. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (RAIRO Theor. Informatics Appl., 2017)

Optimizing Binary Heaps. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (Theory Comput. Syst., 2017)

All-in-one implementation framework for binary heaps. - Jyrki Katajainen (Softw. Pract. Exp., 2017)

Convex-Hull Algorithms: Implementation, Testing, and Experimentation. - Ask Neve Gamby; Jyrki Katajainen (Algorithms, 2018)

A Faster Convex-Hull Algorithm via Bucketing. - Ask Neve Gamby; Jyrki Katajainen (SEA², 2019)

Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny. - Jyrki Katajainen (SEA², 2019)

Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. - Omar Darwish; Amr Elmasry; Jyrki Katajainen (ACM Trans. Algorithms, 2021)

Regular numeral systems for data structures. - Amr Elmasry; Jyrki Katajainen (Acta Informatica, 2022)