Jyrki Katajainen

Publication Activity (10 Years)

Years Active: 1981-2022
Publications (10 Years): 11

Top Topics

Computational Geometry

Top Venues

Publications

Amr Elmasry, Jyrki Katajainen
Regular numeral systems for data structures. Acta Informatica 59 (2-3) (2022)
Omar Darwish, Amr Elmasry, Jyrki Katajainen
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. ACM Trans. Algorithms 17 (2) (2021)
Jyrki Katajainen
Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny. SEA² (2019)
Ask Neve Gamby, Jyrki Katajainen
A Faster Convex-Hull Algorithm via Bucketing. SEA² (2019)
Ask Neve Gamby, Jyrki Katajainen
Convex-Hull Algorithms: Implementation, Testing, and Experimentation. Algorithms 11 (12) (2018)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Heap Construction - 50 Years Later. Comput. J. 60 (5) (2017)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Optimizing Binary Heaps. Theory Comput. Syst. 61 (2) (2017)
Jyrki Katajainen
All-in-one implementation framework for binary heaps. Softw. Pract. Exp. 47 (4) (2017)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Bipartite binomial heaps. RAIRO Theor. Informatics Appl. 51 (3) (2017)
Jyrki Katajainen
Worst-Case-Efficient Dynamic Arrays in Practice. SEA (2016)
Joachim Gudmundsson, Jyrki Katajainen
Editorial, SEA 2014 Special Issue. ACM J. Exp. Algorithmics 21 (1) (2016)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. CSR (2015)
Omar Darwish, Amr Elmasry, Jyrki Katajainen
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. CoRR (2015)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. CoRR (2014)
Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR (2014)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554 (2014)
Amr Elmasry, Jyrki Katajainen
In-Place Binary Counters. MFCS (2013)
Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
Priority Queues and Sorting for Read-Only Data. TAMC (2013)
Amr Elmasry, Jyrki Katajainen
Fat Heaps without Regular Counters. Discret. Math. Algorithms Appl. 5 (2) (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Weak heaps engineered. J. Discrete Algorithms 23 (2013)
Amr Elmasry, Jyrki Katajainen
Branchless Search Programs. SEA (2013)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. COCOON (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
A Catalogue of Algorithms for Building Weak Heaps. IWOCA (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16 (2012)
Amr Elmasry, Jyrki Katajainen
Fat Heaps without Regular Counters. WALCOM (2012)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50 (1) (2012)
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS (2012)
Amr Elmasry, Jyrki Katajainen, Max Stenmark
Branch Mispredictions Don't Affect Mergesort. SEA (2012)
Amr Elmasry, Jyrki Katajainen, Jukka Teuhola
Improved Address-Calculation Coding of Integer Arrays. SPIRE (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS (2012)
Amr Elmasry, Jyrki Katajainen
Lean Programs, Branch Mispredictions, and Sorting. FUN (2012)
Amr Elmasry, Jyrki Katajainen
Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR (2012)
Amr Elmasry, Jyrki Katajainen
Worst-Case Optimal Priority Queues via Extended Regular Counters CoRR (2011)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA (2011)
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)
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 (2011)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
The Magic of a Number System. FUN (2010)
Jyrki Katajainen, S. Srinivasa Rao
A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110 (23) (2010)
Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen
Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA (2010)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Strictly-Regular Number System and Data Structures. SWAT (2010)
Jyrki Katajainen, Bo Simonsen
Adaptable component frameworks: using vector from the C++ standard library as an example. WGP@ICFP (2009)
Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle
Compressing spatio-temporal trajectories. Comput. Geom. 42 (9) (2009)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two-tier relaxed heaps. Acta Informatica 45 (3) (2008)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two new methods for constructing double-ended priority queues from priority queues. Computing 83 (4) (2008)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Multipartite priority queues. ACM Trans. Algorithms 5 (1) (2008)
Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle
Compressing Spatio-temporal Trajectories. ISAAC (2007)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
On the Power of Structural Violations in Priority Queues. CATS (2007)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two-Tier Relaxed Heaps. ISAAC (2006)
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) (2004)
Jyrki Katajainen, Fabio Vitale
Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques. Nord. J. Comput. 10 (3) (2003)
Jyrki Katajainen, Tomi Pasanen
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. SWAT (2002)
Jyrki Katajainen, Jeppe Nejsum Madsen
Performance Tuning an Algorithm for Compressing Relational Tables. SWAT (2002)
Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
In-Place Planar Convex Hull Algorithms. LATIN (2002)
Jyrki Katajainen, Bjarke Buur Mortensen
Experiences with the Design and Implementation of Space-Efficient Deques. WAE (2001)
Jesper Bojesen, Jyrki Katajainen
Interchanging Two Segments of an Array in a Hierarchical Memory System. WAE (2000)
Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
Asymptotically efficient in-place merging. Theor. Comput. Sci. 237 (1-2) (2000)
Jesper Bojesen, Jyrki Katajainen, Maz Spork
Performance Engineering Case Study: Heap Construction. ACM J. Exp. Algorithmics 5 (2000)
Jesper Bojesen, Jyrki Katajainen, Maz Spork
Performance Engineering Case Study: Heap Construction. WAE (1999)
R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola
Heaps and Heapsort on Secondary Storage. Theor. Comput. Sci. 220 (2) (1999)
Jyrki Katajainen, Tomi Pasanen
In-Place Sorting with Fewer Moves. Inf. Process. Lett. 70 (1) (1999)
Jyrki Katajainen
The Ultimate Heapsort. CATS (1998)
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) (1998)
Gerth Stølting Brodal, Jyrki Katajainen
Worst-Case External-Memory Priority Queues. SWAT (1998)
Jyrki Katajainen, Jesper Larsson Träff
A Meticulous Analysis of Mergesort Programs. CIAC (1997)
Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25 (1) (1997)
Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola
Practical In-Place Mergesort. Nord. J. Comput. 3 (1) (1996)
Jyrki Katajainen, Tomi Pasanen, George Titan
Asymptotically Efficient In-Place Merging. MFCS (1995)
Alistair Moffat, Jyrki Katajainen
In-Place Calculation of Minimum-Redundancy Codes. WADS (1995)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA (1995)
Alistair Moffat, Andrew Turpin, Jyrki Katajainen
Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference (1995)
Jyrki Katajainen, Alistair Moffat, Andrew Turpin
A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC (1995)
Jyrki Katajainen, Tomi Pasanen
Sorting Multisets Stably in Minimum Space. Acta Informatica 31 (4) (1994)
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. 27 (4) (1993)
Svante Carlsson, Jyrki Katajainen, Jukka Teuhola
In-place Linear Probing Sort. STACS (1992)
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Space-Efficient Parallel Merging. PARLE (1992)
Jyrki Katajainen, Tomi Pasanen
Sorting Multisets Stably in Minimum Space. SWAT (1992)
Jyrki Katajainen, Timo Raita
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39 (2) (1992)
Jyrki Katajainen, Tomi Pasanen
Stable Minimum Space Partitioning in Linear Time. BIT 32 (4) (1992)
Martti Juhola, Jyrki Katajainen, Timo Raita
Comparison of algorithms for standard median filtering. IEEE Trans. Signal Process. 39 (1) (1991)
Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
A Sublogarithmic Convex Hull Algorithm. BIT 30 (3) (1990)
Jyrki Katajainen, Erkki Mäkinen
A note on the complexity of trie compaction. Bull. EATCS 41 (1990)
Jyrki Katajainen, Erkki Mäkinen
Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1 (4) (1990)
Jyrki Katajainen, Timo Raita
An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32 (3) (1989)
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Local Insertion Sort Revisited. Optimal Algorithms (1989)
Jyrki Katajainen
metric. Computing 40 (2) (1988)
Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT (1988)
Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen
Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17 (1) (1988)
Jyrki Katajainen, Olli Nevalainen
Metrics. RAIRO Theor. Informatics Appl. 21 (2) (1987)
Jyrki Katajainen, Olli Nevalainen, Jukka Teuhola
A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. Inf. Process. Lett. 25 (2) (1987)
Jyrki Katajainen, Olli Nevalainen
Computing relative neighbourhood graphs in the plane. Pattern Recognit. 19 (3) (1986)
Jyrki Katajainen, Martti Penttonen, Jukka Teuhola
Syntax-directed Compression of Program Files. Softw. Pract. Exp. 16 (3) (1986)
Martti Penttonen, Jyrki Katajainen
Notes on the Complexity of Sorting in Abstract Machines. BIT 25 (4) (1985)
Jyrki Katajainen
On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. BIT 23 (1) (1983)
Jyrki Katajainen, Olli Nevalainen
An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. Sci. Comput. Program. 3 (2) (1983)
Olli Nevalainen, Jyrki Katajainen
Experiments with a Closest Point Algorithm in Hamming Space. Angew. Inform. 24 (5) (1982)
Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen
Finding Minimal Spanning Trees in a Euclidean Coordinate Space. BIT 21 (1) (1981)