Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jyrki Katajainen
@article{DBLP:journals/acta/ElmasryK22,
author = {Amr Elmasry and
Jyrki Katajainen},
title = {Regular numeral systems for data structures},
journal = {Acta Informatica},
volume = {59},
number = {2-3},
pages = {245--281},
year = {2022},
url = {https://doi.org/10.1007/s00236-021-00407-9},
doi = {10.1007/S00236-021-00407-9},
timestamp = {Fri, 02 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ElmasryK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DarwishEK21,
author = {Omar Darwish and
Amr Elmasry and
Jyrki Katajainen},
title = {Memory-Adjustable Navigation Piles with Applications to Sorting and
Convex Hulls},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {2},
pages = {18:1--18:19},
year = {2021},
url = {https://doi.org/10.1145/3452938},
doi = {10.1145/3452938},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DarwishEK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sea2/Katajainen19,
author = {Jyrki Katajainen},
editor = {Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos and
Dimitris Souravlias and
Arsenis Tsokas},
title = {Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny},
booktitle = {Analysis of Experimental Algorithms - Special Event, SEA{\({^2}\)}
2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11544},
pages = {376--391},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-34029-2\_25},
doi = {10.1007/978-3-030-34029-2\_25},
timestamp = {Tue, 12 May 2020 10:56:04 +0200},
biburl = {https://dblp.org/rec/conf/sea2/Katajainen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sea2/GambyK19,
author = {Ask Neve Gamby and
Jyrki Katajainen},
editor = {Ilias S. Kotsireas and
Panos M. Pardalos and
Konstantinos E. Parsopoulos and
Dimitris Souravlias and
Arsenis Tsokas},
title = {A Faster Convex-Hull Algorithm via Bucketing},
booktitle = {Analysis of Experimental Algorithms - Special Event, SEA{\({^2}\)}
2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11544},
pages = {473--489},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-34029-2\_30},
doi = {10.1007/978-3-030-34029-2\_30},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sea2/GambyK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/GambyK18,
author = {Ask Neve Gamby and
Jyrki Katajainen},
title = {Convex-Hull Algorithms: Implementation, Testing, and Experimentation},
journal = {Algorithms},
volume = {11},
number = {12},
pages = {195},
year = {2018},
url = {https://doi.org/10.3390/a11120195},
doi = {10.3390/A11120195},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/GambyK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/EdelkampEK17,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {Heap Construction - 50 Years Later},
journal = {Comput. J.},
volume = {60},
number = {5},
pages = {657--674},
year = {2017},
url = {https://doi.org/10.1093/comjnl/bxw085},
doi = {10.1093/COMJNL/BXW085},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/EdelkampEK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ElmasryJK17,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Bipartite binomial heaps},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {51},
number = {3},
pages = {121--133},
year = {2017},
url = {https://doi.org/10.1051/ita/2017010},
doi = {10.1051/ITA/2017010},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ElmasryJK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EdelkampEK17,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {Optimizing Binary Heaps},
journal = {Theory Comput. Syst.},
volume = {61},
number = {2},
pages = {606--636},
year = {2017},
url = {https://doi.org/10.1007/s00224-017-9760-2},
doi = {10.1007/S00224-017-9760-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/EdelkampEK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spe/Katajainen17,
author = {Jyrki Katajainen},
title = {All-in-one implementation framework for binary heaps},
journal = {Softw. Pract. Exp.},
volume = {47},
number = {4},
pages = {523--558},
year = {2017},
url = {https://doi.org/10.1002/spe.2423},
doi = {10.1002/SPE.2423},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spe/Katajainen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GudmundssonK16,
author = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Editorial, {SEA} 2014 Special Issue},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.1:1},
year = {2016},
url = {https://doi.org/10.1145/2854021},
doi = {10.1145/2854021},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GudmundssonK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/Katajainen16,
author = {Jyrki Katajainen},
editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
title = {Worst-Case-Efficient Dynamic Arrays in Practice},
booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9685},
pages = {167--183},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-38851-9\_12},
doi = {10.1007/978-3-319-38851-9\_12},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/Katajainen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/EdelkampEK15,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
editor = {Lev D. Beklemishev and
Daniil V. Musatov},
title = {An In-Place Priority Queue with {O(1)} Time for Push and lg n + {O}
{(} 1 {)} Comparisons for Pop},
booktitle = {Computer Science - Theory and Applications - 10th International Computer
Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July
13-17, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9139},
pages = {204--218},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20297-6\_14},
doi = {10.1007/978-3-319-20297-6\_14},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/EdelkampEK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DarwishEK15,
author = {Omar Darwish and
Amr Elmasry and
Jyrki Katajainen},
title = {Memory-Adjustable Navigation Piles with Applications to Sorting and
Convex Hulls},
journal = {CoRR},
volume = {abs/1510.07185},
year = {2015},
url = {http://arxiv.org/abs/1510.07185},
eprinttype = {arXiv},
eprint = {1510.07185},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DarwishEK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElmasryJKS14,
author = {Amr Elmasry and
Daniel Dahl Juhl and
Jyrki Katajainen and
Srinivasa Rao Satti},
title = {Selection from read-only memory with limited workspace},
journal = {Theor. Comput. Sci.},
volume = {554},
pages = {64--73},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.06.012},
doi = {10.1016/J.TCS.2014.06.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElmasryJKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wea/2014,
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,
Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8504},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2},
doi = {10.1007/978-3-319-07959-2},
isbn = {978-3-319-07958-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElmasryJKS14,
author = {Amr Elmasry and
Daniel Dahl Juhl and
Jyrki Katajainen and
Srinivasa Rao Satti},
title = {Selection from read-only memory with limited workspace},
journal = {CoRR},
volume = {abs/1407.3342},
year = {2014},
url = {http://arxiv.org/abs/1407.3342},
eprinttype = {arXiv},
eprint = {1407.3342},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElmasryJKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EdelkampKE14,
author = {Stefan Edelkamp and
Jyrki Katajainen and
Amr Elmasry},
title = {Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps},
journal = {CoRR},
volume = {abs/1407.3377},
year = {2014},
url = {http://arxiv.org/abs/1407.3377},
eprinttype = {arXiv},
eprint = {1407.3377},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EdelkampKE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/ElmasryK13,
author = {Amr Elmasry and
Jyrki Katajainen},
title = {Fat Heaps without Regular Counters},
journal = {Discret. Math. Algorithms Appl.},
volume = {5},
number = {2},
year = {2013},
url = {https://doi.org/10.1142/S1793830913600069},
doi = {10.1142/S1793830913600069},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/ElmasryK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EdelkampEK13,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {Weak heaps engineered},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {83--97},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.07.002},
doi = {10.1016/J.JDA.2013.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EdelkampEK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ElmasryJKS13,
author = {Amr Elmasry and
Daniel Dahl Juhl and
Jyrki Katajainen and
Srinivasa Rao Satti},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {Selection from Read-Only Memory with Limited Workspace},
booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON}
2013, Hangzhou, China, June 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7936},
pages = {147--157},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_15},
doi = {10.1007/978-3-642-38768-5\_15},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ElmasryJKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EdelkampEKW13,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen and
Armin Wei{\ss}},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Weak Heaps and Friends: Recent Developments},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {1--6},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_1},
doi = {10.1007/978-3-642-45278-9\_1},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/EdelkampEKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ElmasryK13,
author = {Amr Elmasry and
Jyrki Katajainen},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {In-Place Binary Counters},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {349--360},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_32},
doi = {10.1007/978-3-642-40313-2\_32},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ElmasryK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/AsanoEK13,
author = {Tetsuo Asano and
Amr Elmasry and
Jyrki Katajainen},
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Priority Queues and Sorting for Read-Only Data},
booktitle = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
pages = {32--41},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9\_4},
doi = {10.1007/978-3-642-38236-9\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/AsanoEK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/ElmasryK13,
author = {Amr Elmasry and
Jyrki Katajainen},
editor = {Vincenzo Bonifaci and
Camil Demetrescu and
Alberto Marchetti{-}Spaccamela},
title = {Branchless Search Programs},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
Rome, Italy, June 5-7, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7933},
pages = {127--138},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38527-8\_13},
doi = {10.1007/978-3-642-38527-8\_13},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/ElmasryK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EdelkampEK12,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
title = {The weak-heap data structure: Variants and applications},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {187--205},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.04.010},
doi = {10.1016/J.JDA.2012.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EdelkampEK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ElmasryJK12,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Two Skew-Binary Numeral Systems and One Application},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {185--211},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9357-0},
doi = {10.1007/S00224-011-9357-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ElmasryJK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/EdelkampEK12,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
editor = {Juli{\'{a}}n Mestre},
title = {The Weak-Heap Family of Priority Queues in Theory and Praxis},
booktitle = {Eighteenth Computing: The Australasian Theory Symposium, {CATS} 2012,
Melbourne, Australia, January 2012},
series = {{CRPIT}},
volume = {128},
pages = {103--112},
publisher = {Australian Computer Society},
year = {2012},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV128Edelkamp.html},
timestamp = {Mon, 08 Feb 2021 13:26:47 +0100},
biburl = {https://dblp.org/rec/conf/cats/EdelkampEK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/ElmasryK12,
author = {Amr Elmasry and
Jyrki Katajainen},
editor = {Edward A. Hirsch and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Michail Kh. Prilutskii},
title = {Worst-Case Optimal Priority Queues via Extended Regular Counters},
booktitle = {Computer Science - Theory and Applications - 7th International Computer
Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
July 3-7, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7353},
pages = {125--137},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30642-6\_13},
doi = {10.1007/978-3-642-30642-6\_13},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/ElmasryK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ElmasryK12,
author = {Amr Elmasry and
Jyrki Katajainen},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Lean Programs, Branch Mispredictions, and Sorting},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {119--130},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_14},
doi = {10.1007/978-3-642-30347-0\_14},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/ElmasryK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EdelkampEK12,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
editor = {S. Arumugam and
W. F. Smyth},
title = {A Catalogue of Algorithms for Building Weak Heaps},
booktitle = {Combinatorial Algorithms, 23rd International Workshop, {IWOCA} 2012,
Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7643},
pages = {249--262},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35926-2\_27},
doi = {10.1007/978-3-642-35926-2\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/EdelkampEK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChenEEK12,
author = {Jingsen Chen and
Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {In-place Heap Construction with Optimized Comparisons, Moves, and
Cache Misses},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {259--270},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_25},
doi = {10.1007/978-3-642-32589-2\_25},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChenEEK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ElmasryKT12,
author = {Amr Elmasry and
Jyrki Katajainen and
Jukka Teuhola},
editor = {Liliana Calder{\'{o}}n{-}Benavides and
Cristina N. Gonz{\'{a}}lez{-}Caro and
Edgar Ch{\'{a}}vez and
Nivio Ziviani},
title = {Improved Address-Calculation Coding of Integer Arrays},
booktitle = {String Processing and Information Retrieval - 19th International Symposium,
{SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7608},
pages = {205--216},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34109-0\_22},
doi = {10.1007/978-3-642-34109-0\_22},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/ElmasryKT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ElmasryK12,
author = {Amr Elmasry and
Jyrki Katajainen},
editor = {Md. Saidur Rahman and
Shin{-}Ichi Nakano},
title = {Fat Heaps without Regular Counters},
booktitle = {{WALCOM:} Algorithms and Computation - 6th International Workshop,
{WALCOM} 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7157},
pages = {173--185},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28076-4\_18},
doi = {10.1007/978-3-642-28076-4\_18},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/ElmasryK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/ElmasryKS12,
author = {Amr Elmasry and
Jyrki Katajainen and
Max Stenmark},
editor = {Ralf Klasing},
title = {Branch Mispredictions Don't Affect Mergesort},
booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,
Bordeaux, France, June 7-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7276},
pages = {160--171},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30850-5\_15},
doi = {10.1007/978-3-642-30850-5\_15},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/ElmasryKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BachmaierBEGKKSSW11,
author = {Christian Bachmaier and
Franz{-}Josef Brandenburg and
Philip Effinger and
Carsten Gutwenger and
Jyrki Katajainen and
Karsten Klein and
Miro Sp{\"{o}}nemann and
Matthias Stegmaier and
Michael Wybrow},
editor = {Marc J. van Kreveld and
Bettina Speckmann},
title = {The Open Graph Archive: {A} Community-Driven Effort},
booktitle = {Graph Drawing - 19th International Symposium, {GD} 2011, Eindhoven,
The Netherlands, September 21-23, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7034},
pages = {435--440},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25878-7\_42},
doi = {10.1007/978-3-642-25878-7\_42},
timestamp = {Sun, 13 Nov 2022 09:57:29 +0100},
biburl = {https://dblp.org/rec/conf/gd/BachmaierBEGKKSSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EdelkampEK11,
author = {Stefan Edelkamp and
Amr Elmasry and
Jyrki Katajainen},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Two Constant-Factor-Optimal Realizations of Adaptive Heapsort},
booktitle = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7056},
pages = {195--208},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25011-8\_16},
doi = {10.1007/978-3-642-25011-8\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/EdelkampEK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1465,
author = {Christian Bachmaier and
Franz{-}Josef Brandenburg and
Philip Effinger and
Carsten Gutwenger and
Jyrki Katajainen and
Karsten Klein and
Miro Sp{\"{o}}nemann and
Matthias Stegmaier and
Michael Wybrow},
title = {The Open Graph Archive: {A} Community-Driven Effort},
journal = {CoRR},
volume = {abs/1109.1465},
year = {2011},
url = {http://arxiv.org/abs/1109.1465},
eprinttype = {arXiv},
eprint = {1109.1465},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-0993,
author = {Amr Elmasry and
Jyrki Katajainen},
title = {Worst-Case Optimal Priority Queues via Extended Regular Counters},
journal = {CoRR},
volume = {abs/1112.0993},
year = {2011},
url = {http://arxiv.org/abs/1112.0993},
eprinttype = {arXiv},
eprint = {1112.0993},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-0993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatajainenR10,
author = {Jyrki Katajainen and
S. Srinivasa Rao},
title = {A compact data structure for representing a dynamic multiset},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1061--1066},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.007},
doi = {10.1016/J.IPL.2010.08.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatajainenR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ElmasryJK10,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
editor = {Paolo Boldi and
Luisa Gargano},
title = {The Magic of a Number System},
booktitle = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
Italy, June 2-4, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6099},
pages = {156--165},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13122-6\_17},
doi = {10.1007/978-3-642-13122-6\_17},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/ElmasryJK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ElmasryJK10,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
editor = {Haim Kaplan},
title = {Strictly-Regular Number System and Data Structures},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {26--37},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_4},
doi = {10.1007/978-3-642-13731-0\_4},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/ElmasryJK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BruunEKR10,
author = {Asger Bruun and
Stefan Edelkamp and
Jyrki Katajainen and
Jens Rasmussen},
editor = {Paola Festa},
title = {Policy-Based Benchmarking of Weak Heaps and Their Relatives,},
booktitle = {Experimental Algorithms, 9th International Symposium, {SEA} 2010,
Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6049},
pages = {424--435},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13193-6\_36},
doi = {10.1007/978-3-642-13193-6\_36},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/BruunEKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GudmundssonKMOW09,
author = {Joachim Gudmundsson and
Jyrki Katajainen and
Damian Merrick and
Cahya Ong and
Thomas Wolle},
title = {Compressing spatio-temporal trajectories},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {825--841},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.02.002},
doi = {10.1016/J.COMGEO.2009.02.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GudmundssonKMOW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/KatajainenS09,
author = {Jyrki Katajainen and
Bo Simonsen},
editor = {Patrik Jansson and
Sibylle Schupp},
title = {Adaptable component frameworks: using vector from the {C++} standard
library as an example},
booktitle = {Proceedings of the 2009 {ACM} {SIGPLAN} workshop on Generic programming,
WGP@ICFP 2009, Edinburgh, United Kingdom, August 31 - September 2,
2009},
pages = {13--24},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1596614.1596618},
doi = {10.1145/1596614.1596618},
timestamp = {Tue, 06 Nov 2018 16:59:25 +0100},
biburl = {https://dblp.org/rec/conf/icfp/KatajainenS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ElmasryJK08,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Two-tier relaxed heaps},
journal = {Acta Informatica},
volume = {45},
number = {3},
pages = {193--210},
year = {2008},
url = {https://doi.org/10.1007/s00236-008-0070-7},
doi = {10.1007/S00236-008-0070-7},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ElmasryJK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/ElmasryJK08,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Two new methods for constructing double-ended priority queues from
priority queues},
journal = {Computing},
volume = {83},
number = {4},
pages = {193--204},
year = {2008},
url = {https://doi.org/10.1007/s00607-008-0019-2},
doi = {10.1007/S00607-008-0019-2},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/ElmasryJK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElmasryJK08,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Multipartite priority queues},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {1},
pages = {14:1--14:19},
year = {2008},
url = {https://doi.org/10.1145/1435375.1435389},
doi = {10.1145/1435375.1435389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ElmasryJK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/ElmasryJK07,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
editor = {Joachim Gudmundsson and
C. Barry Jay},
title = {On the Power of Structural Violations in Priority Queues},
booktitle = {Theory of Computing 2007. Proceedings of the Thirteenth Computing:
The Australasian Theory Symposium {(CATS2007).} January 30 - Febuary
2, 2007, Ballarat, Victoria, Australia, Proceedings},
series = {{CRPIT}},
volume = {65},
pages = {45--53},
publisher = {Australian Computer Society},
year = {2007},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV65Elmasry.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/ElmasryJK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GudmundssonKMOW07,
author = {Joachim Gudmundsson and
Jyrki Katajainen and
Damian Merrick and
Cahya Ong and
Thomas Wolle},
editor = {Takeshi Tokuyama},
title = {Compressing Spatio-temporal Trajectories},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {763--775},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_66},
doi = {10.1007/978-3-540-77120-3\_66},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GudmundssonKMOW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ElmasryJK06,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
editor = {Tetsuo Asano},
title = {Two-Tier Relaxed Heaps},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {308--317},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_32},
doi = {10.1007/11940128\_32},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ElmasryJK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BronnimannIKMMT04,
author = {Herv{\'{e}} Br{\"{o}}nnimann and
John Iacono and
Jyrki Katajainen and
Pat Morin and
Jason Morrison and
Godfried T. Toussaint},
title = {Space-efficient planar convex hull algorithms},
journal = {Theor. Comput. Sci.},
volume = {321},
number = {1},
pages = {25--40},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.05.004},
doi = {10.1016/J.TCS.2003.05.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BronnimannIKMMT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2004,
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b98413},
doi = {10.1007/B98413},
isbn = {3-540-22339-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KatajainenV03,
author = {Jyrki Katajainen and
Fabio Vitale},
title = {Navigation Piles with Applications to Sorting, Priority Queues, and
Priority Deques},
journal = {Nord. J. Comput.},
volume = {10},
number = {3},
pages = {238},
year = {2003},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/KatajainenV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BronnimannIKMMT02,
author = {Herv{\'{e}} Br{\"{o}}nnimann and
John Iacono and
Jyrki Katajainen and
Pat Morin and
Jason Morrison and
Godfried T. Toussaint},
editor = {Sergio Rajsbaum},
title = {In-Place Planar Convex Hull Algorithms},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {494--507},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_43},
doi = {10.1007/3-540-45995-2\_43},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BronnimannIKMMT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenM02,
author = {Jyrki Katajainen and
Jeppe Nejsum Madsen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Performance Tuning an Algorithm for Compressing Relational Tables},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {398--407},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_41},
doi = {10.1007/3-540-45471-3\_41},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenP02,
author = {Jyrki Katajainen and
Tomi Pasanen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A Randomized In-Place Algorithm for Positioning the kth Element in
a Multiset},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {408--417},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_42},
doi = {10.1007/3-540-45471-3\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/KatajainenM01,
author = {Jyrki Katajainen and
Bjarke Buur Mortensen},
editor = {Gerth St{\o}lting Brodal and
Daniele Frigioni and
Alberto Marchetti{-}Spaccamela},
title = {Experiences with the Design and Implementation of Space-Efficient
Deques},
booktitle = {Algorithm Engineering, 5th International Workshop, {WAE} 2001 Aarhus,
Denmark, August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2141},
pages = {39--50},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44688-5\_4},
doi = {10.1007/3-540-44688-5\_4},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/KatajainenM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BojesenKS00,
author = {Jesper Bojesen and
Jyrki Katajainen and
Maz Spork},
title = {Performance Engineering Case Study: Heap Construction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {15},
year = {2000},
url = {https://doi.org/10.1145/351827.384257},
doi = {10.1145/351827.384257},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BojesenKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertKP00,
author = {Viliam Geffert and
Jyrki Katajainen and
Tomi Pasanen},
title = {Asymptotically efficient in-place merging},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {159--181},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00162-5},
doi = {10.1016/S0304-3975(98)00162-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeffertKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/BojesenK00,
author = {Jesper Bojesen and
Jyrki Katajainen},
editor = {Stefan N{\"{a}}her and
Dorothea Wagner},
title = {Interchanging Two Segments of an Array in a Hierarchical Memory System},
booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1982},
pages = {159--170},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44691-5\_14},
doi = {10.1007/3-540-44691-5\_14},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/BojesenK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatajainenP99,
author = {Jyrki Katajainen and
Tomi Pasanen},
title = {In-Place Sorting with Fewer Moves},
journal = {Inf. Process. Lett.},
volume = {70},
number = {1},
pages = {31--37},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00038-1},
doi = {10.1016/S0020-0190(99)00038-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatajainenP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FadelJKT99,
author = {R. Fadel and
K. V. Jakobsen and
Jyrki Katajainen and
Jukka Teuhola},
title = {Heaps and Heapsort on Secondary Storage},
journal = {Theor. Comput. Sci.},
volume = {220},
number = {2},
pages = {345--362},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00006-7},
doi = {10.1016/S0304-3975(99)00006-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FadelJKT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/BojesenKS99,
author = {Jesper Bojesen and
Jyrki Katajainen and
Maz Spork},
editor = {Jeffrey Scott Vitter and
Christos D. Zaroliagis},
title = {Performance Engineering Case Study: Heap Construction},
booktitle = {Algorithm Engineering, 3rd International Workshop, {WAE} '99, London,
UK, July 19-21, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1668},
pages = {302--316},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48318-7\_24},
doi = {10.1007/3-540-48318-7\_24},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/BojesenKS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HagerupKNR98,
author = {Torben Hagerup and
Jyrki Katajainen and
Naomi Nishimura and
Prabhakar Ragde},
title = {Characterizing Multiterminal Flow Networks and Computing Flows in
Networks of Small Treewidth},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {3},
pages = {366--375},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1592},
doi = {10.1006/JCSS.1998.1592},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HagerupKNR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/Katajainen98,
author = {Jyrki Katajainen},
editor = {Xuemin Lin},
title = {The Ultimate Heapsort},
booktitle = {Proceedings of Computing: The Fourth Australasian Theory Symposium
(CATS'98), Perth, WA, Australia, February 2-3, 1998},
series = {Australian Computer Science Communications},
volume = {20},
number = {3},
pages = {87--96},
publisher = {Springer-Verlag Singapore Pte. Ltd.},
year = {1998},
timestamp = {Mon, 16 Mar 2020 17:44:09 +0100},
biburl = {https://dblp.org/rec/conf/cats/Katajainen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalK98,
author = {Gerth St{\o}lting Brodal and
Jyrki Katajainen},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Worst-Case External-Memory Priority Queues},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {107--118},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054359},
doi = {10.1007/BFB0054359},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DietzfelbingerHKP97,
author = {Martin Dietzfelbinger and
Torben Hagerup and
Jyrki Katajainen and
Martti Penttonen},
title = {A Reliable Randomized Algorithm for the Closest-Pair Problem},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {19--51},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0873},
doi = {10.1006/JAGM.1997.0873},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DietzfelbingerHKP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KatajainenT97,
author = {Jyrki Katajainen and
Jesper Larsson Tr{\"{a}}ff},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {A Meticulous Analysis of Mergesort Programs},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {217--228},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_74},
doi = {10.1007/3-540-62592-5\_74},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KatajainenT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/KatajainenPT96,
author = {Jyrki Katajainen and
Tomi Pasanen and
Jukka Teuhola},
title = {Practical In-Place Mergesort},
journal = {Nord. J. Comput.},
volume = {3},
number = {1},
pages = {27--40},
year = {1996},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/KatajainenPT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/MoffatTK95,
author = {Alistair Moffat and
Andrew Turpin and
Jyrki Katajainen},
editor = {James A. Storer and
Martin Cohn},
title = {Space-Efficient Construction of Optimal Prefix Codes},
booktitle = {Proceedings of the {IEEE} Data Compression Conference, {DCC} 1995,
Snowbird, Utah, USA, March 28-30, 1995},
pages = {192--201},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/DCC.1995.515509},
doi = {10.1109/DCC.1995.515509},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/MoffatTK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KatajainenMT95,
author = {Jyrki Katajainen and
Alistair Moffat and
Andrew Turpin},
editor = {John Staples and
Peter Eades and
Naoki Katoh and
Alistair Moffat},
title = {A Fast and Space - Economical Algorithm for Length - Limited Coding},
booktitle = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95,
Cairns, Australia, December 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1004},
pages = {12--21},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0015404},
doi = {10.1007/BFB0015404},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KatajainenMT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KatajainenPT95,
author = {Jyrki Katajainen and
Tomi Pasanen and
George Titan},
editor = {Jir{\'{\i}} Wiedermann and
Petr H{\'{a}}jek},
title = {Asymptotically Efficient In-Place Merging},
booktitle = {Mathematical Foundations of Computer Science 1995, 20th International
Symposium, MFCS'95, Prague, Czech Republic, August 28 - September
1, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {969},
pages = {211--220},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60246-1\_127},
doi = {10.1007/3-540-60246-1\_127},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KatajainenPT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HagerupKNR95,
author = {Torben Hagerup and
Jyrki Katajainen and
Naomi Nishimura and
Prabhakar Ragde},
editor = {Kenneth L. Clarkson},
title = {Characterizations of k-Terminal Flow Networks and Computing Network
Flows in Partial k-Trees},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {641--649},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313832},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/HagerupKNR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MoffatK95,
author = {Alistair Moffat and
Jyrki Katajainen},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {In-Place Calculation of Minimum-Redundancy Codes},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {393--402},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_79},
doi = {10.1007/3-540-60220-8\_79},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/MoffatK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/KatajainenP94,
author = {Jyrki Katajainen and
Tomi Pasanen},
title = {Sorting Multisets Stably in Minimum Space},
journal = {Acta Informatica},
volume = {31},
number = {4},
pages = {301--313},
year = {1994},
url = {https://doi.org/10.1007/BF01178508},
doi = {10.1007/BF01178508},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/KatajainenP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/KatajainenLP93,
author = {Jyrki Katajainen and
Christos Levcopoulos and
Ola Petersson},
title = {Space-Efficient Parallel Merging},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {27},
number = {4},
pages = {295--310},
year = {1993},
url = {https://doi.org/10.1051/ita/1993270402951},
doi = {10.1051/ITA/1993270402951},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/KatajainenLP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KatajainenP92,
author = {Jyrki Katajainen and
Tomi Pasanen},
title = {Stable Minimum Space Partitioning in Linear Time},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {580--585},
year = {1992},
url = {https://doi.org/10.1007/BF01994842},
doi = {10.1007/BF01994842},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KatajainenP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KatajainenR92,
author = {Jyrki Katajainen and
Timo Raita},
title = {An Analysis of the Longest Match and the Greedy Heuristics in Text
Encoding},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {281--294},
year = {1992},
url = {https://doi.org/10.1145/128749.128751},
doi = {10.1145/128749.128751},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KatajainenR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/parle/Katajainen92,
author = {Jyrki Katajainen and
Christos Levcopoulos and
Ola Petersson},
editor = {Daniel Etiemble and
Jean{-}Claude Syre},
title = {Space-Efficient Parallel Merging},
booktitle = {{PARLE} '92: Parallel Architectures and Languages Europe, 4th International
{PARLE} Conference, Paris, France, June 15-18, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {605},
pages = {37--49},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55599-4\_79},
doi = {10.1007/3-540-55599-4\_79},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/parle/Katajainen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CarlssonKT92,
author = {Svante Carlsson and
Jyrki Katajainen and
Jukka Teuhola},
editor = {Alain Finkel and
Matthias Jantzen},
title = {In-place Linear Probing Sort},
booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer
Science, Cachan, France, February 13-15, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {577},
pages = {581--587},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55210-3\_214},
doi = {10.1007/3-540-55210-3\_214},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CarlssonKT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenP92,
author = {Jyrki Katajainen and
Tomi Pasanen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Sorting Multisets Stably in Minimum Space},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {410--421},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_37},
doi = {10.1007/3-540-55706-7\_37},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/JuholaKR91,
author = {Martti Juhola and
Jyrki Katajainen and
Timo Raita},
title = {Comparison of algorithms for standard median filtering},
journal = {{IEEE} Trans. Signal Process.},
volume = {39},
number = {1},
pages = {204--208},
year = {1991},
url = {https://doi.org/10.1109/78.80784},
doi = {10.1109/78.80784},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/JuholaKR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FjallstromKLP90,
author = {Per{-}Olof Fj{\"{a}}llstr{\"{o}}m and
Jyrki Katajainen and
Christos Levcopoulos and
Ola Petersson},
title = {A Sublogarithmic Convex Hull Algorithm},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {378--384},
year = {1990},
url = {https://doi.org/10.1007/BF01931655},
doi = {10.1007/BF01931655},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FjallstromKLP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/KatajainenM90,
author = {Jyrki Katajainen and
Erkki M{\"{a}}kinen},
title = {A note on the complexity of trie compaction},
journal = {Bull. {EATCS}},
volume = {41},
pages = {212--216},
year = {1990},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/KatajainenM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KatajainenM90,
author = {Jyrki Katajainen and
Erkki M{\"{a}}kinen},
title = {Tree Compression and Optimization with Applications},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {4},
pages = {425--448},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000291},
doi = {10.1142/S0129054190000291},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KatajainenM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/KatajainenR89,
author = {Jyrki Katajainen and
Timo Raita},
title = {An Approximation Algorithm for Space-Optimal Encoding of a Text},
journal = {Comput. J.},
volume = {32},
number = {3},
pages = {228--237},
year = {1989},
url = {https://doi.org/10.1093/comjnl/32.3.228},
doi = {10.1093/COMJNL/32.3.228},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/KatajainenR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oa/KatajainenLP89,
author = {Jyrki Katajainen and
Christos Levcopoulos and
Ola Petersson},
editor = {Hristo N. Djidjev},
title = {Local Insertion Sort Revisited},
booktitle = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
29 - June 2, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {401},
pages = {239--253},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51859-2\_19},
doi = {10.1007/3-540-51859-2\_19},
timestamp = {Wed, 14 Jul 2021 17:16:13 +0200},
biburl = {https://dblp.org/rec/conf/oa/KatajainenLP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Katajainen88,
author = {Jyrki Katajainen},
title = {The region approach for computing relative neighbourhood graphs in
the L\({}_{\mbox{p}}\) metric},
journal = {Computing},
volume = {40},
number = {2},
pages = {147--161},
year = {1988},
url = {https://doi.org/10.1007/BF02247943},
doi = {10.1007/BF02247943},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Katajainen88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KatajainenLP88,
author = {Jyrki Katajainen and
Jan van Leeuwen and
Martti Penttonen},
title = {Fast Simulation of Turing Machines by Random Access Machines},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {1},
pages = {77--88},
year = {1988},
url = {https://doi.org/10.1137/0217005},
doi = {10.1137/0217005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KatajainenLP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosKL88,
author = {Christos Levcopoulos and
Jyrki Katajainen and
Andrzej Lingas},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {190--198},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_21},
doi = {10.1007/3-540-19487-8\_21},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosKL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatajainenNT87,
author = {Jyrki Katajainen and
Olli Nevalainen and
Jukka Teuhola},
title = {A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood
Graphs},
journal = {Inf. Process. Lett.},
volume = {25},
number = {2},
pages = {77--86},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90225-0},
doi = {10.1016/0020-0190(87)90225-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatajainenNT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/KatajainenN87,
author = {Jyrki Katajainen and
Olli Nevalainen},
title = {An Almost Naive Algorithm for Finding Relative Neighbourhood Graphs
in L\({}_{\mbox{p}}\) Metrics},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {21},
number = {2},
pages = {199--215},
year = {1987},
url = {https://doi.org/10.1051/ita/1987210201991},
doi = {10.1051/ITA/1987210201991},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/KatajainenN87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/KatajainenN86,
author = {Jyrki Katajainen and
Olli Nevalainen},
title = {Computing relative neighbourhood graphs in the plane},
journal = {Pattern Recognit.},
volume = {19},
number = {3},
pages = {221--228},
year = {1986},
url = {https://doi.org/10.1016/0031-3203(86)90012-9},
doi = {10.1016/0031-3203(86)90012-9},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pr/KatajainenN86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spe/KatajainenPT86,
author = {Jyrki Katajainen and
Martti Penttonen and
Jukka Teuhola},
title = {Syntax-directed Compression of Program Files},
journal = {Softw. Pract. Exp.},
volume = {16},
number = {3},
pages = {269--276},
year = {1986},
url = {https://doi.org/10.1002/spe.4380160307},
doi = {10.1002/SPE.4380160307},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spe/KatajainenPT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PenttonenK85,
author = {Martti Penttonen and
Jyrki Katajainen},
title = {Notes on the Complexity of Sorting in Abstract Machines},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {611--622},
year = {1985},
url = {https://doi.org/10.1007/BF01936140},
doi = {10.1007/BF01936140},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PenttonenK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Katajainen83,
author = {Jyrki Katajainen},
title = {On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean
Space},
journal = {{BIT}},
volume = {23},
number = {1},
pages = {1--8},
year = {1983},
url = {https://doi.org/10.1007/BF01937321},
doi = {10.1007/BF01937321},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Katajainen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/KatajainenN83,
author = {Jyrki Katajainen and
Olli Nevalainen},
title = {An Alternative for the Implementation of Kruskal's Minimal Spanning
Tree Algorithm},
journal = {Sci. Comput. Program.},
volume = {3},
number = {2},
pages = {205--216},
year = {1983},
url = {https://doi.org/10.1016/0167-6423(83)90011-4},
doi = {10.1016/0167-6423(83)90011-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scp/KatajainenN83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/wi/NevalainenK82,
author = {Olli Nevalainen and
Jyrki Katajainen},
title = {Experiments with a Closest Point Algorithm in Hamming Space},
journal = {Angew. Inform.},
volume = {24},
number = {5},
pages = {277--281},
year = {1982},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/wi/NevalainenK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NevalainenEK81,
author = {Olli Nevalainen and
Jarmo Ernvall and
Jyrki Katajainen},
title = {Finding Minimal Spanning Trees in a Euclidean Coordinate Space},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {46--54},
year = {1981},
url = {https://doi.org/10.1007/BF01934070},
doi = {10.1007/BF01934070},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NevalainenEK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:46 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:
