Sciweavers

118 search results - page 10 / 24
» soda 2008
Sort
View
SODA
2008
ACM
83views Algorithms» more  SODA 2008»
14 years 11 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
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
14 years 11 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 11 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 11 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
14 years 11 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari