Följ
Jyrki Katajainen
Jyrki Katajainen
Academic worker at the Institute of Dalalogy
Verifierad e-postadress på di.ku.dk - Startsida
Titel
Citeras av
Citeras av
År
A reliable randomized algorithm for the closest-pair problem
M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen
Journal of Algorithms 25 (1), 19-51, 1997
2611997
Space-efficient planar convex hull algorithms
H Brönnimann, J Iacono, J Katajainen, P Morin, J Morrison, G Toussaint
Theoretical Computer Science 321 (1), 25-40, 2004
94*2004
Practical in-place mergesort
J Katajainen, T Pasanen, J Teuhola
Nord. J. Comput. 3 (1), 27-40, 1996
921996
Worst-case efficient external-memory priority queues
GS Brodal, J Katajainen
Scandinavian Workshop on Algorithm Theory, 107-118, 1998
861998
Tree compression and optimization with applications
J Katajainen, E Mäkinen
International Journal of Foundations of Computer Science 1 (04), 425-447, 1990
851990
In-place calculation of minimum-redundancy codes
A Moffat, J Katajainen
Workshop on Algorithms and Data Structures, 393-402, 1995
781995
Comparison of algorithms for standard median filtering
M Juhola, J Katajainen, T Raita
IEEE Transactions on Signal Processing 39 (1), 204-208, 1991
761991
Compressing spatio-temporal trajectories
J Gudmundsson, J Katajainen, D Merrick, C Ong, T Wolle
Computational geometry 42 (9), 825-841, 2009
722009
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
T Hagerup, J Katajainen, N Nishimura, P Ragde
Journal of Computer and System Sciences 57 (3), 366-375, 1998
701998
Asymptotically efficient in-place merging
V Geffert, J Katajainen, T Pasanen
Theoretical Computer Science 237 (1-2), 159-181, 2000
682000
The region approach for computing relative neighbourhood graphs in the Lp metric
J Katajainen
Computing 40 (2), 147-161, 1988
631988
A meticulous analysis of mergesort programs
J Katajainen, JL Träff
Italian Conference on Algorithms and Complexity, 217-228, 1997
571997
Heaps and heapsort on secondary storage
R Fadel, KV Jakobsen, J Katajainen, J Teuhola
Theoretical Computer Science 220 (2), 345-362, 1999
541999
Constructing Delaunay triangulations by merging buckets in quad tree order
J Katajainen, M Koppinen
Fundamenta Informaticae 11 (3), 275-288, 1988
461988
Stable minimum space partitioning in linear time
J Katajainen, T Pasanen
BIT Numerical Mathematics 32 (4), 580-585, 1992
441992
Syntax‐directed compression of program files
J Katajainen, M Penttonen, J Teuhola
Software: Practice and Experience 16 (3), 269-276, 1986
381986
In-place sorting with fewer moves
J Katajainen, TA Pasanen
Information Processing Letters 70 (1), 31-37, 1999
361999
An analysis of the longest match and the greedy heuristics in text encoding
J Katajainen, T Raita
Journal of the ACM (JACM) 39 (2), 281-294, 1992
351992
A fast and space-economical algorithm for length-limited coding
J Katajainen, A Moffat, A Turpin
International Symposium on Algorithms and Computation, 12-21, 1995
341995
Sorting multisets stably in minimum space
J Katajainen, T Pasanen
Acta Informatica 31 (4), 301-313, 1994
301994
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20