2002 · 130 citations · 24 references
Consider a rooted tree whose nodes can be in two states: marked or unmarked. The marked ancestor problem is to maintain a data structure with the following operations: mark(v) marks node v: unmark(v) removes any marks from node v; firstmarked(v) returns the first marked node on the path from v to the root. We show tight upper and lower bounds for the marked ancestor problem. The lower bounds are proved in the cell probe model, the algorithms run on a unit-cost RAM. As easy corollaries we prove (often optimal) lower bounds on a number of problems. These include planar range searching, including the existential or emptiness problem, priority search trees static tree union-find, and several problems from dynamic computational geometry, including segment intersection, interval maintenance, and ray shooting in the plane. Our upper bounds improve algorithms from various fields, including coloured ancestor problems and maintenance of balanced parentheses.
24
Handbook of discrete and computational geometry
Choice Reviews Online · 1998 · 1.5K citations · Full text
Edward M. McCreight · SIAM Journal on Computing · 1985 · 499 citations
The cell probe complexity of dynamic data structures
Michael L. Fredman, Michael Saks · 1989 · 359 citations · Full text