# Lowest common ancestor

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 2015

*Correspondence: Marc G. Dumont, Department of Biogeochemistry, Max Planck Institute for Terrestrial Microbiology, Karl-vonâ€¦Â (More)

Is this relevant?

2012

2012

- 2012

In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform someâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we willâ€¦Â (More)

Is this relevant?

2007

2007

- ESA
- 2007

This work studies lowest common ancestor problems in directed acyclic graphs. We present fast algorithms for solving the Allâ€¦Â (More)

Is this relevant?

2006

2006

- Electronic Colloquium on Computational Complexity
- 2006

We present two new methods for finding a lowest common ancesto r (LCA) for each pair of vertices of a directed acyclic graph (dagâ€¦Â (More)

Is this relevant?

1994

1994

- SWAT
- 1994

This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion ofâ€¦Â (More)

Is this relevant?

1994

1994

- Inf. Process. Lett.
- 1994

It is well known how to preprocess a rooted tree in linear time to yield the lowest common ancestor of any given pair of nodes inâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- SIAM J. Comput.
- 1984

We consider the following problem: Given a collection of rooted trees, answer on-line queries of the form, "What is the nearestâ€¦Â (More)

Is this relevant?

1980

1980

- 21st Annual Symposium on Foundations of Computerâ€¦
- 1980

We investigate two lowest common ancestor (LCA) problems on trees. We give a linear time algorithm for the off-line problem, on aâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- STOC
- 1973

Trees in an n node forest are to be merged according to instructions in a given sequence, while other instructions in theâ€¦Â (More)

Is this relevant?