Jyrki Katajainen

	2012
67		Amr Elmasry, Jyrki Katajainen: Lean Programs, Branch Mispredictions, and Sorting. FUN 2012: 119-130
66		Amr Elmasry, Jyrki Katajainen, Max Stenmark: Branch Mispredictions Don't Affect Mergesort. SEA 2012: 160-171
65		Amr Elmasry, Jyrki Katajainen: Fat Heaps without Regular Counters. WALCOM 2012: 173-185
64		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50(1): 185-211 (2012)
	2011
63		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
62		Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen: Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208
61		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)
60		Amr Elmasry, Jyrki Katajainen: Worst-Case Optimal Priority Queues via Extended Regular Counters CoRR abs/1112.0993: (2011)
	2010
59		Amr Elmasry, Claus Jensen, Jyrki Katajainen: The Magic of a Number System. FUN 2010: 156-165
58		Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen: Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA 2010: 424-435
57		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Strictly-Regular Number System and Data Structures. SWAT 2010: 26-37
56		Jyrki Katajainen, S. Srinivasa Rao: A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23): 1061-1066 (2010)
	2009
55		Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009)
	2008
54		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Multipartite priority queues. ACM Transactions on Algorithms 5(1): (2008)
53		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two-tier relaxed heaps. Acta Inf. 45(3): 193-210 (2008)
52		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two new methods for constructing double-ended priority queues from priority queues. Computing 83(4): 193-204 (2008)
	2007
51		Amr Elmasry, Claus Jensen, Jyrki Katajainen: On the Power of Structural Violations in Priority Queues. CATS 2007: 45-53
50		Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle: Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775
	2006
49		Amr Elmasry, Claus Jensen, Jyrki Katajainen: Two-Tier Relaxed Heaps. ISAAC 2006: 308-317
	2004
48		Torben Hagerup, Jyrki Katajainen: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings Springer 2004
47		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)
	2003
46		Jyrki Katajainen, Fabio Vitale: Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques. Nord. J. Comput. 10(3): 238- (2003)
	2002
45		Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
44		Jyrki Katajainen, Jeppe Nejsum Madsen: Performance Tuning an Algorithm for Compressing Relational Tables. SWAT 2002: 398-407
43		Jyrki Katajainen, Tomi Pasanen: A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. SWAT 2002: 408-417
	2001
42		Jyrki Katajainen, Bjarke Buur Mortensen: Experiences with the Design and Implementation of Space-Efficient Deques. Algorithm Engineering 2001: 39-50
	2000
41		Jesper Bojesen, Jyrki Katajainen: Interchanging Two Segments of an Array in a Hierarchical Memory System. Algorithm Engineering 2000: 159-170
40		Jesper Bojesen, Jyrki Katajainen, Maz Spork: Performance Engineering Case Study: Heap Construction. ACM Journal of Experimental Algorithmics 5: 15 (2000)
39		Viliam Geffert, Jyrki Katajainen, Tomi Pasanen: Asymptotically efficient in-place merging. Theor. Comput. Sci. 237(1-2): 159-181 (2000)
	1999
38		Jesper Bojesen, Jyrki Katajainen, Maz Spork: Performance Engineering Case Study: Heap Construction. Algorithm Engineering 1999: 302-316
37		Jyrki Katajainen, Tomi Pasanen: In-Place Sorting with Fewer Moves. Inf. Process. Lett. 70(1): 31-37 (1999)
36		R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola: Heaps and Heapsort on Secondary Storage. Theor. Comput. Sci. 220(2): 345-362 (1999)
	1998
35		Jyrki Katajainen: The Ultimate Heapsort. CATS 1998: 87-96
34		Gerth Stølting Brodal, Jyrki Katajainen: Worst-Case External-Memory Priority Queues. SWAT 1998: 107-118
33		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)
	1997
32		Jyrki Katajainen, Jesper Larsson Träff: A Meticulous Analysis of Mergesort Programs. CIAC 1997: 217-228
31		Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen: A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997)
	1996
30		Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola: Practical In-Place Mergesort. Nord. J. Comput. 3(1): 27-40 (1996)
	1995
29		Alistair Moffat, Andrew Turpin, Jyrki Katajainen: Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995: 192-201
28		Jyrki Katajainen, Alistair Moffat, Andrew Turpin: A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995: 12-21
27		Jyrki Katajainen, Tomi Pasanen, George Titan: Asymptotically Efficient In-Place Merging. MFCS 1995: 211-220
26		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
25		Alistair Moffat, Jyrki Katajainen: In-Place Calculation of Minimum-Redundancy Codes. WADS 1995: 393-402
	1994
24		Jyrki Katajainen, Tomi Pasanen: Sorting Multisets Stably in Minimum Space. Acta Inf. 31(4): 301-313 (1994)
	1993
23		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. ITA 27(4): 295-310 (1993)
	1992
22		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. PARLE 1992: 37-49
21		Svante Carlsson, Jyrki Katajainen, Jukka Teuhola: In-place Linear Probing Sort. STACS 1992: 581-587
20		Jyrki Katajainen, Tomi Pasanen: Sorting Multisets Stably in Minimum Space. SWAT 1992: 410-421
19		Jyrki Katajainen, Tomi Pasanen: Stable Minimum Space Partitioning in Linear Time. BIT 32(4): 580-585 (1992)
18		Jyrki Katajainen, Timo Raita: An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992)
	1991
17		Martti Juhola, Jyrki Katajainen, Timo Raita: Comparison of algorithms for standard median filtering. IEEE Transactions on Signal Processing 39(1): 204-208 (1991)
	1990
16		Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990)
15		Jyrki Katajainen, Erkki Mäkinen: A note on the complexity of trie compaction. Bulletin of the EATCS 41: 212-216 (1990)
14		Jyrki Katajainen, Erkki Mäkinen: Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1(4): 425-448 (1990)
	1989
13		Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253
12		Jyrki Katajainen, Timo Raita: An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32(3): 228-237 (1989)
	1988
11		Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas: An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198
10		Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen: Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988)
	1987
9		Jyrki Katajainen, Olli Nevalainen: An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in Lp Metrics. ITA 21(2): 199-215 (1987)
8		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)
	1986
7		Jyrki Katajainen, Olli Nevalainen: Computing relative neighbourhood graphs in the plane. Pattern Recognition 19(3): 221-228 (1986)
6		Jyrki Katajainen, Martti Penttonen, Jukka Teuhola: Syntax-directed Compression of Program Files. Softw., Pract. Exper. 16(3): 269-276 (1986)
	1985
5		Martti Penttonen, Jyrki Katajainen: Notes on the Complexity of Sorting in Abstract Machines. BIT 25(4): 611-622 (1985)
	1983
4		Jyrki Katajainen: On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. BIT 23(1): 2-8 (1983)
3		Jyrki Katajainen, Olli Nevalainen: An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. Sci. Comput. Program. 3(2): 205-216 (1983)
	1982
2		Olli Nevalainen, Jyrki Katajainen: Experiments with a Closest Point Algorithm in Hamming Space. Angewandte Informatik 24(5): 277-281 (1982)
	1981
1		Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen: Finding Minimal Spanning Trees in a Euclidean Coordinate Space. BIT 21(1): 46-54 (1981)

Coauthor Index

1	Christian Bachmaier	[61] [63]
2	Jesper Bojesen	[38] [40] [41]
3	Franz-Josef Brandenburg	[61] [63]
4	Gerth Stølting Brodal	[34]
5	Hervé Brönnimann	[45] [47]
6	Asger Bruun	[58]
7	Svante Carlsson	[21]
8	Martin Dietzfelbinger	[31]
9	Stefan Edelkamp	[58] [62]
10	Philip Effinger	[61] [63]
11	Amr Elmasry	[49] [51] [52] [53] [54] [57] [59] [60] [62] [64] [65] [66] [67]
12	Jarmo Ernvall	[1]
13	R. Fadel	[36]
14	Per-Olof Fjällström	[16]
15	Viliam Geffert	[39]
16	Joachim Gudmundsson	[50] [55]
17	Carsten Gutwenger	[61] [63]
18	Torben Hagerup	[26] [31] [33] [48]
19	John Iacono	[45] [47]
20	K. V. Jakobsen	[36]
21	Claus Jensen	[49] [51] [52] [53] [54] [57] [59] [64]
22	Martti Juhola	[17]
23	Karsten Klein	[61] [63]
24	Jan van Leeuwen	[10]
25	Christos Levcopoulos	[11] [13] [16] [22] [23]
26	Andrzej Lingas	[11]
27	Jeppe Nejsum Madsen	[44]
28	Erkki Mäkinen	[14] [15]
29	Damian Merrick	[50] [55]
30	Alistair Moffat	[25] [28] [29]
31	Pat Morin	[45] [47]
32	Jason Morrison	[45] [47]
33	Bjarke Buur Mortensen	[42]
34	Olli Nevalainen	[1] [2] [3] [7] [8] [9]
35	Naomi Nishimura	[26] [33]
36	Cahya Ong	[50] [55]
37	Tomi Pasanen	[19] [20] [24] [27] [30] [37] [39] [43]
38	Martti Penttonen	[5] [6] [10] [31]
39	Ola Petersson	[13] [16] [22] [23]
40	Prabhakar Ragde	[26] [33]
41	Timo Raita	[12] [17] [18]
42	S. Srinivasa Rao (Srinivasa Rao Satti)	[56]
43	Jens Rasmussen	[58]
44	Miro Spönemann	[61] [63]
45	Maz Spork	[38] [40]
46	Matthias Stegmaier	[61] [63]
47	Max Stenmark	[66]
48	Jukka Teuhola	[6] [8] [21] [30] [36]
49	George Titan	[27]
50	Godfried T. Toussaint	[45] [47]
51	Jesper Larsson Träff	[32]
52	Andrew Turpin	[28] [29]
53	Fabio Vitale	[46]
54	Thomas Wolle	[50] [55]
55	Michael Wybrow	[61] [63]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page