SODA
2008
ACM
13 years 11 months ago
2008
ACM
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...
CCCG
2010
13 years 11 months ago
2010
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...
CPM
2008
Springer
13 years 11 months ago
2008
Springer
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...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
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...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
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...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
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...
WADS
2009
Springer
14 years 4 months ago
2009
Springer
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...