( en | de | ru )

 

Disambiguation of "Katajainen, Jyrki"

Author of the publication

copydeleteadd this publication to your clipboard
Practical in-place mergesort

, , and . Nordic J. of Computing, 3 (1): 27--40 (March 1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jyrki Alakuijala

Jyrki Syväri

Jyrki Lötjönen

 

Other publications of authors with the same name

Worst-Case Optimal Priority Queues via Extended Regular Counters, and . CoRR, (2011)Adaptable component frameworks: using vector from the C++ standard library as an example., and . WGP@ICFP, page 13-24. ACM, (2009)Two Constant-Factor-Optimal Realizations of Adaptive Heapsort., , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 195-208. Springer, (2011)A Catalogue of Algorithms for Building Weak Heaps., , and . IWOCA, volume 7643 of Lecture Notes in Computer Science, page 249-262. Springer, (2012)Sorting Multisets Stably in Minimum Space., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 410-421. Springer, (1992)Strictly-Regular Number System and Data Structures., , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 26-37. Springer, (2010)A Meticulous Analysis of Mergesort Programs., and . CIAC, volume 1203 of Lecture Notes in Computer Science, page 217-228. Springer, (1997)Heap Construction - 50 Years Later., , and . Comput. J., 60 (5): 657-674 (2017)Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny.. SEA², volume 11544 of Lecture Notes in Computer Science, page 376-391. Springer, (2019)Two new methods for constructing double-ended priority queues from priority queues., , and . Computing, 83 (4): 193-204 (2008)