Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

LATIN
2000
Springer

favoriteEmaildiscussreport

85views Information Technology» more LATIN 2000»

The LCA Problem Revisited

13 years 8 months ago

The LCA Problem Revisited

Download www.ics.uci.edu

We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin [1].

Michael A. Bender, Martin Farach-Colton

Real-time Traffic

Algorithm | Information Management | LATIN 2000 | Least Common Ancestor | Optimal Lca Computation |

claim paper

Related Content

» Faster algorithms for finding lowest common ancestors in directed acyclic graphs

» Theoretical and Practical Improvements on the RMQProblem with Applications to LCA and LCE

» A parametric mixture model for clustering multivariate binary data

» LCAbased selection for XML document collections

» On the Range MaximumSum Segment Query Problem

» Pseudorandom walks on regular digraphs and the RL vs L problem

» Web page revisitation revisited implications of a longterm clickstream study of browser us...

» Race finding and ranking compact connected trees for keyword proximity search over xml doc...

» Revisiting Norm Estimation in Data Streams

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	LATIN
Authors	Michael A. Bender, Martin Farach-Colton

Comments (0)