The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jyrki Katajainen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
    A Reliable Randomized Algorithm for the Closest-Pair Problem. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:19-51 [Journal]
  2. Jyrki Katajainen, Jesper Larsson Träff
    A Meticulous Analysis of Mergesort Programs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:217-228 [Conf]
  3. Alistair Moffat, Andrew Turpin, Jyrki Katajainen
    Space-Efficient Construction of Optimal Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1995, pp:192-201 [Conf]
  4. Amr Elmasry, Claus Jensen, Jyrki Katajainen
    Two-Tier Relaxed Heaps. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:308-317 [Conf]
  5. Jyrki Katajainen, Alistair Moffat, Andrew Turpin
    A Fast and Space - Economical Algorithm for Length - Limited Coding. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:12-21 [Conf]
  6. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    In-Place Planar Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:494-507 [Conf]
  7. Jyrki Katajainen, Tomi Pasanen, George Titan
    Asymptotically Efficient In-Place Merging. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:211-220 [Conf]
  8. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Local Insertion Sort Revisited. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:239-253 [Conf]
  9. Jyrki Katajainen
    Space-Efficient Parallel Merging. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:37-49 [Conf]
  10. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:641-649 [Conf]
  11. Svante Carlsson, Jyrki Katajainen, Jukka Teuhola
    In-place Linear Probing Sort. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:581-587 [Conf]
  12. Gerth Stølting Brodal, Jyrki Katajainen
    Worst-Case External-Memory Priority Queues. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:107-118 [Conf]
  13. Jyrki Katajainen, Jeppe Nejsum Madsen
    Performance Tuning an Algorithm for Compressing Relational Tables. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:398-407 [Conf]
  14. Jyrki Katajainen, Tomi Pasanen
    A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:408-417 [Conf]
  15. Jyrki Katajainen, Tomi Pasanen
    Sorting Multisets Stably in Minimum Space. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:410-421 [Conf]
  16. Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
    An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:190-198 [Conf]
  17. Alistair Moffat, Jyrki Katajainen
    In-Place Calculation of Minimum-Redundancy Codes. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:393-402 [Conf]
  18. Jesper Bojesen, Jyrki Katajainen
    Interchanging Two Segments of an Array in a Hierarchical Memory System. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:159-170 [Conf]
  19. Jesper Bojesen, Jyrki Katajainen, Maz Spork
    Performance Engineering Case Study: Heap Construction. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:302-316 [Conf]
  20. Jyrki Katajainen, Bjarke Buur Mortensen
    Experiences with the Design and Implementation of Space-Efficient Deques. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:39-50 [Conf]
  21. Jyrki Katajainen, Tomi Pasanen
    Sorting Multisets Stably in Minimum Space. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:4, pp:301-313 [Journal]
  22. Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    A Sublogarithmic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:3, pp:378-384 [Journal]
  23. Jyrki Katajainen
    On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. [Citation Graph (0, 0)][DBLP]
    BIT, 1983, v:23, n:1, pp:2-8 [Journal]
  24. Jyrki Katajainen, Tomi Pasanen
    Stable Minimum Space Partitioning in Linear Time. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:4, pp:580-585 [Journal]
  25. Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen
    Finding Minimal Spanning Trees in a Euclidean Coordinate Space. [Citation Graph (0, 0)][DBLP]
    BIT, 1981, v:21, n:1, pp:46-54 [Journal]
  26. Martti Penttonen, Jyrki Katajainen
    Notes on the Complexity of Sorting in Abstract Machines. [Citation Graph (0, 0)][DBLP]
    BIT, 1985, v:25, n:4, pp:611-622 [Journal]
  27. Jyrki Katajainen, Timo Raita
    An Approximation Algorithm for Space-Optimal Encoding of a Text. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:3, pp:228-237 [Journal]
  28. Jyrki Katajainen, Erkki Mäkinen
    A note on the complexity of trie compaction. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:41, n:, pp:212-216 [Journal]
  29. Jyrki Katajainen, Erkki Mäkinen
    Tree Compression and Optimization with Applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:4, pp:425-448 [Journal]
  30. Jyrki Katajainen, Olli Nevalainen, Jukka Teuhola
    A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:77-86 [Journal]
  31. Jyrki Katajainen, Tomi Pasanen
    In-Place Sorting with Fewer Moves. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:31-37 [Journal]
  32. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Space-Efficient Parallel Merging. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:4, pp:295-310 [Journal]
  33. Jyrki Katajainen, Olli Nevalainen
    An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in Lp Metrics. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:2, pp:199-215 [Journal]
  34. Jyrki Katajainen, Timo Raita
    An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:2, pp:281-294 [Journal]
  35. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:3, pp:366-375 [Journal]
  36. Jesper Bojesen, Jyrki Katajainen, Maz Spork
    Performance Engineering Case Study: Heap Construction. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:15- [Journal]
  37. Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola
    Practical In-Place Mergesort. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:1, pp:27-40 [Journal]
  38. Jyrki Katajainen, Fabio Vitale
    Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:3, pp:238-0 [Journal]
  39. Jyrki Katajainen, Olli Nevalainen
    Computing relative neighbourhood graphs in the plane. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1986, v:19, n:3, pp:221-228 [Journal]
  40. Jyrki Katajainen, Olli Nevalainen
    An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1983, v:3, n:2, pp:205-216 [Journal]
  41. Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen
    Fast Simulation of Turing Machines by Random Access Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:77-88 [Journal]
  42. Jyrki Katajainen, Martti Penttonen, Jukka Teuhola
    Syntax-directed Compression of Program Files. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1986, v:16, n:3, pp:269-276 [Journal]
  43. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    Space-efficient planar convex hull algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:25-40 [Journal]
  44. R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola
    Heaps and Heapsort on Secondary Storage. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:2, pp:345-362 [Journal]
  45. Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
    Asymptotically efficient in-place merging. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:159-181 [Journal]
  46. Olli Nevalainen, Jyrki Katajainen
    Experiments with a Closest Point Algorithm in Hamming Space. [Citation Graph (0, 0)][DBLP]
    Angewandte Informatik, 1982, v:24, n:5, pp:277-281 [Journal]

  47. On the Power of Structural Violations in Priority Queues. [Citation Graph (, )][DBLP]


  48. The Ultimate Heapsort. [Citation Graph (, )][DBLP]


  49. Compressing Spatio-temporal Trajectories. [Citation Graph (, )][DBLP]


  50. Strictly-Regular Number System and Data Structures. [Citation Graph (, )][DBLP]


  51. Policy-Based Benchmarking of Weak Heaps and Their Relatives, . [Citation Graph (, )][DBLP]


  52. The Magic of a Number System. [Citation Graph (, )][DBLP]


  53. Two-tier relaxed heaps. [Citation Graph (, )][DBLP]


  54. Compressing spatio-temporal trajectories. [Citation Graph (, )][DBLP]


  55. Two new methods for constructing double-ended priority queues from priority queues. [Citation Graph (, )][DBLP]


Search in 5.666secs, Finished in 5.668secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002