| 2008 |
|---|
| 52 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Multipartite priority queues.
ACM Transactions on Algorithms 5(1): (2008) |
| 51 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-tier relaxed heaps.
Acta Inf. 45(3): 193-210 (2008) |
| 2007 |
|---|
| 50 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
On the Power of Structural Violations in Priority Queues.
CATS 2007: 45-53 |
| 49 | EE | Joachim Gudmundsson,
Jyrki Katajainen,
Damian Merrick,
Cahya Ong,
Thomas Wolle:
Compressing Spatio-temporal Trajectories.
ISAAC 2007: 763-775 |
| 2006 |
|---|
| 48 | EE | Amr Elmasry,
Claus Jensen,
Jyrki Katajainen:
Two-Tier Relaxed Heaps.
ISAAC 2006: 308-317 |
| 2004 |
|---|
| 47 | | Torben Hagerup,
Jyrki Katajainen:
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings
Springer 2004 |
| 46 | EE | 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 |
|---|
| 45 | | Jyrki Katajainen,
Fabio Vitale:
Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques.
Nord. J. Comput. 10(3): 238- (2003) |
| 2002 |
|---|
| 44 | EE | Hervé Brönnimann,
John Iacono,
Jyrki Katajainen,
Pat Morin,
Jason Morrison,
Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms.
LATIN 2002: 494-507 |
| 43 | EE | Jyrki Katajainen,
Jeppe Nejsum Madsen:
Performance Tuning an Algorithm for Compressing Relational Tables.
SWAT 2002: 398-407 |
| 42 | EE | Jyrki Katajainen,
Tomi Pasanen:
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.
SWAT 2002: 408-417 |
| 2001 |
|---|
| 41 | EE | Jyrki Katajainen,
Bjarke Buur Mortensen:
Experiences with the Design and Implementation of Space-Efficient Deques.
Algorithm Engineering 2001: 39-50 |
| 2000 |
|---|
| 40 | EE | Jesper Bojesen,
Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System.
Algorithm Engineering 2000: 159-170 |
| 39 | EE | Jesper Bojesen,
Jyrki Katajainen,
Maz Spork:
Performance Engineering Case Study: Heap Construction.
ACM Journal of Experimental Algorithmics 5: 15 (2000) |
| 38 | EE | Viliam Geffert,
Jyrki Katajainen,
Tomi Pasanen:
Asymptotically efficient in-place merging.
Theor. Comput. Sci. 237(1-2): 159-181 (2000) |
| 1999 |
|---|
| 37 | EE | Jesper Bojesen,
Jyrki Katajainen,
Maz Spork:
Performance Engineering Case Study: Heap Construction.
Algorithm Engineering 1999: 302-316 |
| 36 | EE | Jyrki Katajainen,
Tomi Pasanen:
In-Place Sorting with Fewer Moves.
Inf. Process. Lett. 70(1): 31-37 (1999) |
| 35 | EE | R. Fadel,
K. V. Jakobsen,
Jyrki Katajainen,
Jukka Teuhola:
Heaps and Heapsort on Secondary Storage.
Theor. Comput. Sci. 220(2): 345-362 (1999) |
| 1998 |
|---|
| 34 | | Jyrki Katajainen:
The Ultimate Heapsort.
CATS 1998: 87-96 |
| 33 | EE | Gerth Stølting Brodal,
Jyrki Katajainen:
Worst-Case External-Memory Priority Queues.
SWAT 1998: 107-118 |
| 32 | | 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 |
|---|
| 31 | | Jyrki Katajainen,
Jesper Larsson Träff:
A Meticulous Analysis of Mergesort Programs.
CIAC 1997: 217-228 |
| 30 | | 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 |
|---|
| 29 | | Jyrki Katajainen,
Tomi Pasanen,
Jukka Teuhola:
Practical In-Place Mergesort.
Nord. J. Comput. 3(1): 27-40 (1996) |
| 1995 |
|---|
| 28 | | Alistair Moffat,
Andrew Turpin,
Jyrki Katajainen:
Space-Efficient Construction of Optimal Prefix Codes.
Data Compression Conference 1995: 192-201 |
| 27 | | Jyrki Katajainen,
Alistair Moffat,
Andrew Turpin:
A Fast and Space - Economical Algorithm for Length - Limited Coding.
ISAAC 1995: 12-21 |
| 26 | | Jyrki Katajainen,
Tomi Pasanen,
George Titan:
Asymptotically Efficient In-Place Merging.
MFCS 1995: 211-220 |
| 25 | | 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 |
| 24 | | Alistair Moffat,
Jyrki Katajainen:
In-Place Calculation of Minimum-Redundancy Codes.
WADS 1995: 393-402 |
| 1994 |
|---|
| 23 | | Jyrki Katajainen,
Tomi Pasanen:
Sorting Multisets Stably in Minimum Space.
Acta Inf. 31(4): 301-313 (1994) |
| 1993 |
|---|
| 22 | | Jyrki Katajainen,
Christos Levcopoulos,
Ola Petersson:
Space-Efficient Parallel Merging.
ITA 27(4): 295-310 (1993) |
| 1992 |
|---|
| 21 | | Jyrki Katajainen:
Space-Efficient Parallel Merging.
PARLE 1992: 37-49 |
| 20 | | Svante Carlsson,
Jyrki Katajainen,
Jukka Teuhola:
In-place Linear Probing Sort.
STACS 1992: 581-587 |
| 19 | | Jyrki Katajainen,
Tomi Pasanen:
Sorting Multisets Stably in Minimum Space.
SWAT 1992: 410-421 |
| 18 | | Jyrki Katajainen,
Tomi Pasanen:
Stable Minimum Space Partitioning in Linear Time.
BIT 32(4): 580-585 (1992) |
| 17 | EE | Jyrki Katajainen,
Timo Raita:
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding.
J. ACM 39(2): 281-294 (1992) |
| 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 | EE | 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) |
