Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Katajainen, Jyrki"'
We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random rea
Externí odkaz:
http://arxiv.org/abs/1510.07185
Let $n$ denote the number of elements currently in a data structure. An in-place heap is stored in the first $n$ locations of an array, uses $O(1)$ extra space, and supports the operations: minimum, insert, and extract-min. We introduce an in-place h
Externí odkaz:
http://arxiv.org/abs/1407.3377
Given an unordered array of $N$ elements drawn from a totally ordered set and an integer $k$ in the range from $1$ to $N$, in the classic selection problem the task is to find the $k$-th smallest element in the array. We study the complexity of this
Externí odkaz:
http://arxiv.org/abs/1407.3342
Autor:
Elmasry, Amr, Katajainen, Jyrki
We consider the classical problem of representing a collection of priority queues under the operations \Findmin{}, \Insert{}, \Decrease{}, \Meld{}, \Delete{}, and \Deletemin{}. In the comparison-based model, if the first four operations are to be sup
Externí odkaz:
http://arxiv.org/abs/1112.0993
Autor:
Bachmaier, Christian, Brandenburg, Franz J., Effinger, Philip, Gutwenger, Carsten, Katajainen, Jyrki, Klein, Karsten, Spönemann, Miro, Stegmaier, Matthias, Wybrow, Michael
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimental results, this creates a demand for a public archive to gather and st
Externí odkaz:
http://arxiv.org/abs/1109.1465
Autor:
Elmasry, Amr1 (AUTHOR) amr.a.elmasry@gmail.com, Katajainen, Jyrki2 (AUTHOR)
Publikováno v:
Acta Informatica. Jun2022, Vol. 59 Issue 2/3, p245-281. 37p.
Publikováno v:
In Journal of Discrete Algorithms November 2013 23:83-97
Publikováno v:
In Journal of Discrete Algorithms October 2012 16:187-205
Publikováno v:
In Computational Geometry: Theory and Applications 2009 42(9):825-841
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.