Sciweavers

99 search results - page 1 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
SODA
2008
ACM
83views Algorithms» more  SODA 2008»
13 years 5 months ago
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
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...
Seth Pettie
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 3 months ago
Sources of Superlinearity in Davenport-Schinzel Sequences
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problem...
Seth Pettie
COMPGEOM
2011
ACM
12 years 7 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
COMPGEOM
2010
ACM
13 years 8 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir