We study the problem of finding lowest common ancestors (LCA) in trees and directed
acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA …

Given a static array of n totally ordered objects, the range minimum query problem is to build
a data structure that allows us to answer efficiently subsequent on-line queries of the form …

This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …

We consider the following problem. Given a rooted tree T, label the nodes of T in the most
compact way such that, given the labels of two nodes u and v, one can determine in constant …

Several papers describe linear time algorithms to preprocess a tree, such that one can
answer subsequent nearest common ancestor queries in constant time. Here, we survey …

In this paper, we study the fundamental problem of maintaining a dynamic collection of
strings under the following operations:• make_string–add a string of constant length,• concat …

This article shows the weighted matching problem on general graphs can be solved in time
O (n (m+ n log n)) for n and m the number of vertices and edges, respectively. This was …

We present a new data structure that facilitates approximate nearest neighbor searches on a
dynamic set of points in a metric space that has a bounded doubling dimension. Our data …

We consider full text index construction in external memory (EM). Our first contribution is an
inducing algorithm for suffix arrays in external memory, which runs in sorting complexity …

We present two new methods for finding a lowest common ancestor (LCA) for each pair of
vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is …