default search action
Jyrki Katajainen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j47]Amr Elmasry
, Jyrki Katajainen:
Regular numeral systems for data structures. Acta Informatica 59(2-3): 245-281 (2022) - 2021
- [j46]Omar Darwish, Amr Elmasry, Jyrki Katajainen:
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. ACM Trans. Algorithms 17(2): 18:1-18:19 (2021)
2010 – 2019
- 2019
- [c45]Jyrki Katajainen
Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny. SEA² 2019: 376-391 - [c44]Ask Neve Gamby
A Faster Convex-Hull Algorithm via Bucketing. SEA² 2019: 473-489 - 2018
- [j45]Ask Neve Gamby
Convex-Hull Algorithms: Implementation, Testing, and Experimentation. Algorithms 11(12): 195 (2018) - 2017
- [j44]Stefan Edelkamp
Heap Construction - 50 Years Later. Comput. J. 60(5): 657-674 (2017) - [j43]Amr Elmasry, Claus Jensen
Bipartite binomial heaps. RAIRO Theor. Informatics Appl. 51(3): 121-133 (2017) - [j42]Stefan Edelkamp
Optimizing Binary Heaps. Theory Comput. Syst. 61(2): 606-636 (2017) - [j41]Jyrki Katajainen:
All-in-one implementation framework for binary heaps. Softw. Pract. Exp. 47(4): 523-558 (2017) - 2016
- [j40]Joachim Gudmundsson
Editorial, SEA 2014 Special Issue. ACM J. Exp. Algorithmics 21(1): 1.1:1 (2016) - [c43]Jyrki Katajainen:
Worst-Case-Efficient Dynamic Arrays in Practice. SEA 2016: 167-183 - 2015
- [c42]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. CSR 2015: 204-218 - [i5]Omar Darwish, Amr Elmasry, Jyrki Katajainen:
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. CoRR abs/1510.07185 (2015) - 2014
- [j39]Amr Elmasry, Daniel Dahl Juhl
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554: 64-73 (2014) - [e2]Joachim Gudmundsson, Jyrki Katajainen:
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings. Lecture Notes in Computer Science 8504, Springer 2014, ISBN 978-3-319-07958-5 [contents] - [i4]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. CoRR abs/1407.3342 (2014) - [i3]Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry:
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR abs/1407.3377 (2014) - 2013
- [j38]Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters. Discret. Math. Algorithms Appl. 5(2) (2013) - [j37]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Weak heaps engineered. J. Discrete Algorithms 23: 83-97 (2013) - [c41]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. COCOON 2013: 147-157 - [c40]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA 2013: 1-6 - [c39]Amr Elmasry, Jyrki Katajainen:
In-Place Binary Counters. MFCS 2013: 349-360 - [c38]Tetsuo Asano, Amr Elmasry, Jyrki Katajainen:
Priority Queues and Sorting for Read-Only Data. TAMC 2013: 32-41 - [c37]Amr Elmasry, Jyrki Katajainen:
Branchless Search Programs. SEA 2013: 127-138 - 2012
- [j36]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16: 187-205 (2012) - [j35]Amr Elmasry, Claus Jensen
Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50(1): 185-211 (2012) - [c36]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112 - [c35]Amr Elmasry, Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR 2012: 125-137 - [c34]Amr Elmasry, Jyrki Katajainen:
Lean Programs, Branch Mispredictions, and Sorting. FUN 2012: 119-130 - [c33]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
A Catalogue of Algorithms for Building Weak Heaps. IWOCA 2012: 249-262 - [c32]Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270 - [c31]Amr Elmasry, Jyrki Katajainen, Jukka Teuhola:
Improved Address-Calculation Coding of Integer Arrays. SPIRE 2012: 205-216 - [c30]Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters. WALCOM 2012: 173-185 - [c29]Amr Elmasry, Jyrki Katajainen, Max Stenmark:
Branch Mispredictions Don't Affect Mergesort. SEA 2012: 160-171 - 2011
- [c28]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. GD 2011: 435-440 - [c27]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208 - [i2]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) - [i1]Amr Elmasry, Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters. CoRR abs/1112.0993 (2011) - 2010
- [j34]Jyrki Katajainen, S. Srinivasa Rao:
A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23): 1061-1066 (2010) - [c26]Amr Elmasry, Claus Jensen
The Magic of a Number System. FUN 2010: 156-165 - [c25]Amr Elmasry, Claus Jensen
Strictly-Regular Number System and Data Structures. SWAT 2010: 26-37 - [c24]Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen:
Policy-Based Benchmarking of Weak Heaps and Their Relatives, . SEA 2010: 424-435
2000 – 2009
- 2009
- [j33]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009) - [c23]Jyrki Katajainen, Bo Simonsen:
Adaptable component frameworks: using vector from the C++ standard library as an example. WGP@ICFP 2009: 13-24 - 2008
- [j32]Amr Elmasry, Claus Jensen
Two-tier relaxed heaps. Acta Informatica 45(3): 193-210 (2008) - [j31]Amr Elmasry, Claus Jensen
Two new methods for constructing double-ended priority queues from priority queues. Computing 83(4): 193-204 (2008) - [j30]Amr Elmasry, Claus Jensen
Multipartite priority queues. ACM Trans. Algorithms 5(1): 14:1-14:19 (2008) - 2007
- [c22]Amr Elmasry, Claus Jensen, Jyrki Katajainen:
On the Power of Structural Violations in Priority Queues. CATS 2007: 45-53 - [c21]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775 - 2006
- [c20]Amr Elmasry, Claus Jensen
Two-Tier Relaxed Heaps. ISAAC 2006: 308-317 - 2004
- [j29]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004) - [e1]Torben Hagerup, Jyrki Katajainen:
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science 3111, Springer 2004, ISBN 3-540-22339-8 [contents] - 2003
- [j28]Jyrki Katajainen, Fabio Vitale:
Navigation Piles with Applications to Sorting, Priority Queues, and Priority Deques. Nord. J. Comput. 10(3): 238- (2003) - 2002
- [c19]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin
In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 - [c18]Jyrki Katajainen, Jeppe Nejsum Madsen:
Performance Tuning an Algorithm for Compressing Relational Tables. SWAT 2002: 398-407 - [c17]Jyrki Katajainen, Tomi Pasanen
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset. SWAT 2002: 408-417 - 2001
- [c16]Jyrki Katajainen, Bjarke Buur Mortensen:
Experiences with the Design and Implementation of Space-Efficient Deques. WAE 2001: 39-50 - 2000
- [j27]Jesper Bojesen, Jyrki Katajainen, Maz Spork:
Performance Engineering Case Study: Heap Construction. ACM J. Exp. Algorithmics 5: 15 (2000) - [j26]Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
Asymptotically efficient in-place merging. Theor. Comput. Sci. 237(1-2): 159-181 (2000) - [c15]Jesper Bojesen, Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System. WAE 2000: 159-170
1990 – 1999
- 1999
- [j25]Jyrki Katajainen, Tomi Pasanen
In-Place Sorting with Fewer Moves. Inf. Process. Lett. 70(1): 31-37 (1999) - [j24]R. Fadel, K. V. Jakobsen, Jyrki Katajainen, Jukka Teuhola:
Heaps and Heapsort on Secondary Storage. Theor. Comput. Sci. 220(2): 345-362 (1999) - [c14]Jesper Bojesen, Jyrki Katajainen, Maz Spork:
Performance Engineering Case Study: Heap Construction. WAE 1999: 302-316 - 1998
- [j23]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) - [c13]Jyrki Katajainen:
The Ultimate Heapsort. CATS 1998: 87-96 - [c12]Gerth Stølting Brodal
Worst-Case External-Memory Priority Queues. SWAT 1998: 107-118 - 1997
- [j22]Martin Dietzfelbinger
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997) - [c11]Jyrki Katajainen, Jesper Larsson Träff:
A Meticulous Analysis of Mergesort Programs. CIAC 1997: 217-228 - 1996
- [j21]Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola:
Practical In-Place Mergesort. Nord. J. Comput. 3(1): 27-40 (1996) - 1995
- [c10]Alistair Moffat, Andrew Turpin, Jyrki Katajainen:
Space-Efficient Construction of Optimal Prefix Codes. Data Compression Conference 1995: 192-201 - [c9]Jyrki Katajainen, Alistair Moffat, Andrew Turpin:
A Fast and Space - Economical Algorithm for Length - Limited Coding. ISAAC 1995: 12-21 - [c8]Jyrki Katajainen, Tomi Pasanen
Asymptotically Efficient In-Place Merging. MFCS 1995: 211-220 - [c7]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 - [c6]Alistair Moffat, Jyrki Katajainen:
In-Place Calculation of Minimum-Redundancy Codes. WADS 1995: 393-402 - 1994
- [j20]Jyrki Katajainen, Tomi Pasanen
Sorting Multisets Stably in Minimum Space. Acta Informatica 31(4): 301-313 (1994) - 1993
- [j19]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. 27(4): 295-310 (1993) - 1992
- [j18]Jyrki Katajainen, Tomi Pasanen
Stable Minimum Space Partitioning in Linear Time. BIT 32(4): 580-585 (1992) - [j17]Jyrki Katajainen, Timo Raita:
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding. J. ACM 39(2): 281-294 (1992) - [c5]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. PARLE 1992: 37-49 - [c4]Svante Carlsson, Jyrki Katajainen, Jukka Teuhola:
In-place Linear Probing Sort. STACS 1992: 581-587 - [c3]Jyrki Katajainen, Tomi Pasanen
Sorting Multisets Stably in Minimum Space. SWAT 1992: 410-421 - 1991
- [j16]Martti Juhola, Jyrki Katajainen, Timo Raita:
Comparison of algorithms for standard median filtering. IEEE Trans. Signal Process. 39(1): 204-208 (1991) - 1990
- [j15]Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990) - [j14]Jyrki Katajainen, Erkki Mäkinen:
A note on the complexity of trie compaction. Bull. EATCS 41: 212-216 (1990) - [j13]Jyrki Katajainen, Erkki Mäkinen:
Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1(4): 425-448 (1990)
1980 – 1989
- 1989
- [j12]Jyrki Katajainen, Timo Raita:
An Approximation Algorithm for Space-Optimal Encoding of a Text. Comput. J. 32(3): 228-237 (1989) - [c2]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253 - 1988
- [j11]Jyrki Katajainen:
The region approach for computing relative neighbourhood graphs in the Lp metric. Computing 40(2): 147-161 (1988) - [j10]Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen:
Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988) - [c1]Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas:
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198 - 1987
- [j9]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) - [j8]Jyrki Katajainen, Olli Nevalainen:
An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs in Lp Metrics. RAIRO Theor. Informatics Appl. 21(2): 199-215 (1987) - 1986
- [j7]Jyrki Katajainen, Olli Nevalainen:
Computing relative neighbourhood graphs in the plane. Pattern Recognit. 19(3): 221-228 (1986) - [j6]Jyrki Katajainen, Martti Penttonen, Jukka Teuhola:
Syntax-directed Compression of Program Files. Softw. Pract. Exp. 16(3): 269-276 (1986) - 1985
- [j5]Martti Penttonen, Jyrki Katajainen:
Notes on the Complexity of Sorting in Abstract Machines. BIT 25(4): 611-622 (1985) - 1983
- [j4]Jyrki Katajainen:
On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean Space. BIT 23(1): 1-8 (1983) - [j3]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
- [j2]Olli Nevalainen, Jyrki Katajainen:
Experiments with a Closest Point Algorithm in Hamming Space. Angew. Inform. 24(5): 277-281 (1982) - 1981
- [j1]Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen:
Finding Minimal Spanning Trees in a Euclidean Coordinate Space. BIT 21(1): 46-54 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: