17 search results - page 2 / 4 » Short Labels for Lowest Common Ancestors in Trees |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...