Sciweavers

SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 6 days 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
CCCG
2010
14 years 7 days ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 18 days ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
COMPGEOM
2001
ACM
14 years 2 months ago
A fully dynamic algorithm for planar
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
Timothy M. Chan
ICALP
2010
Springer
14 years 2 months ago
Mergeable Dictionaries
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
John Iacono, Özgür Özkan
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
14 years 4 months ago
Small Stretch Spanners on Dynamic Graphs
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
14 years 5 months ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...