eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-11-30
6091
1
16
10.4230/DagSemProc.06091.1
article
06091 Abstracts Collection – Data Structures
Arge, Lars
Sedgewick, Robert
Wagner, Dorothea
From 26.02.06 to 03.03.06, the Dagstuhl Seminar 06091 ``Data Structures'' was held
in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06091/DagSemProc.06091.1/DagSemProc.06091.1.pdf
Algorithms
data structures
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-11-30
6091
1
1
10.4230/DagSemProc.06091.2
article
06091 Executive Summary – Data Structures
Arge, Lars
Sedgewick, Robert
Wagner, Dorothea
The Dagstuhl Seminar on Data Structures in 2006 reported on ongoing research on data structures, including randomized, cache-oblivious and succinct data structures. There was some shift of interest away from purely theoretical issues towards scientific studies that are directly relevant to practical applications. The participants were asked to think about the direction that research on data structure should take. Several presentations were provocative responses to this question. Interest in the topic remains high: another attendance record was set.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06091/DagSemProc.06091.2/DagSemProc.06091.2.pdf
algorithms
data structures
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-11-30
6091
1
8
10.4230/DagSemProc.06091.3
article
Die Another Day
Fleischer, Rudolf
The hydra was a many-headed monster from Greek mythology that could grow
one or two new heads when one of its heads got cut off.
It was the second task of Hercules to kill this monster.
In an abstract sense a hydra can be modeled by a tree
where the leaves are the heads, and when a
head is cut off some subtrees get duplicated.
Different hydra species differ by the location of subtrees to be duplicated
and by the number of new subtrees grown in each step.
Using some deep mathematics, it had been shown that two
classes of rather restricted hydra species must always die,
independent of the order in which heads are cut off.
In this paper we provide an elementary proof
which actually gives a complete classification
of all hydra species as immortal or doomed.
Now, if Hercules had known this...
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06091/DagSemProc.06091.3/DagSemProc.06091.3.pdf
Hydra
Koenig's Lemma
Peano Arithmetic
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-11-30
6091
1
4
10.4230/DagSemProc.06091.4
article
In-Place Randomized Slope-Selection
Blunck, Henrik
Vahrenhold, Jan
Slope selection is a well-known algorithmic tool used in the context of computing robust
estimators for fitting a line to a collection $mathcal{P}$ of $n$ points in the plane. We
demonstrate that it is possible to perform slope selection in expected $mathcal{O}(n log n)$
time using only constant extra space in addition to the space needed for representing the input.
Our solution is based upon a space-efficient variant of Matouv{s}ek's randomized interpolation
search, and we believe that the techniques developed in this paper will prove helpful in the
design of space-efficient randomized algorithms using samples. To underline this, we also sketch
how to compute the repeated median line estimator in an in-place setting.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06091/DagSemProc.06091.4/DagSemProc.06091.4.pdf
In-Place Algorithms
Slope Selection
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2006-11-30
6091
1
10
10.4230/DagSemProc.06091.5
article
Towards a Final Analysis of Pairing Heaps
Pettie, Seth
Fredman, Sedgewick, Sleator, and Tarjan proposed the
{em pairing heap}
as a self-adjusting, streamlined version of the Fibonacci heap.
It provably supports all priority queue operations in logarithmic
time and is known to be extremely efficient in practice.
However, despite its simplicity and empirical superiority,
the pairing heap is one of the few popular data structures
whose basic complexity remains open.
In this paper we prove that pairing heaps support the
deletemin operation in optimal logarithmic time and all other operations
(insert, meld, and decreasekey) in time
$O(2^{2sqrt{loglog n}})$. This result gives
the {em first} sub-logarithmic time bound for decreasekey
and comes close to the
lower bound of $Omega(loglog n)$ established by Fredman.
Pairing heaps have a well known but poorly understood relationship to
splay trees and, to date, the transfer of ideas has flowed in one direction:
from splaying to pairing. One contribution of this paper is a
new analysis that reasons explicitly with information-theoretic
measures. Whether these ideas could contribute to the analysis
of splay trees is an open question.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol06091/DagSemProc.06091.5/DagSemProc.06091.5.pdf
Data structure
heap
self-adjusting
amortized analysis