Splay trees, Davenport-Schinzel sequences, and the deque conjecture

Splay trees, Davenport-Schinzel sequences, and the deque conjecture (2007)

by Seth Pettie

Citations:

9 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	Splay trees, Davenport-Schinzel sequences, and the deque conjecture	user correction
AUTHOR NAME	Seth Pettie	user correction
AUTHOR AFFIL	The University of Michigan	user correction
ABSTRACT	We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree as a Davenport-Schinzel sequence S, none of whose subsequences are isomorphic to fixed forbidden subsequence. We direct this technique towards Tarjan’s deque conjecture and prove that n deque operations require O(nα ∗ (n)) time, where α ∗ (n) is the minimum number of applications of the inverse-Ackermann function mapping n to a constant. We are optimistic that this approach could be directed towards other open conjectures on splay trees such as the traversal and split conjectures.	user correction
YEAR	2007	INFERENCE
CITATIONS	33 found	ParsCit 1.0