Jyrki Katajainen

99 papers A* 1A 2B 15C 6Misc 5Journal 52Unranked 17

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