Harel, D. and Tarjan, R. 1984. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing 13, 2, 338--355. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Efficient Key Derivation for Access Hierarchies - Atallah, Blanton, Frikken (Correct)
No context found.
Harel, D. and Tarjan, R. 1984. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing 13, 2, 338--355.
On the Approximation of Computing of - Evolutionary Trees Research (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestor. SIAM Journal on Computing, 13(2):338--355, 1984.
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch (Correct)
No context found.
D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, 13, (1984), pp. 338--355.
Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, May 1984.
Dynamic Tree Cross Products - Marcus Raitner University (2004) (Correct)
No context found.
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13 (1984) 338--355
Shortest Inspection-Path - Queries In Simple (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338--355, 1984.
Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, May 1984.
Locally Consistent Parsing and Applications to - Approximate String Comparisons (Correct)
No context found.
Dov Harel and Robert E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, May 1984.
Dynamic Tree Cross Products - Raitner (2004) (Correct)
No context found.
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13 (1984) 338--355
Dynamic Tree Cross Products - Raitner (2004) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984.
Maintaining Hierarchical Graph Views for Dynamic Graphs - Raitner (2004) (Correct)
No context found.
Dov Harel and Robert Endre Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984.
Distance and Routing Labeling Schemes for Non-Poositively Curved.. - Chepoi (2003) (Correct)
No context found.
D. Harel, R. Tarjan, Fast algorithms for finding nearest common ancestor, SIAM J. Comput., 13 (1984), 338--355.
Efficient Algorithms for Single Link Failure Recovery and Its - Application To Atm (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SICOMP, 13(2), pages 338-355, 1984.
Geometric Retrieval for Grid Points in the RAM Model - Spyros Sioutas Christos (Correct)
No context found.
D. Harel, R. E. Tarjan, Fast algorithms for finding nearest common ancestor, SIAM J. Comput.13 (1984), pp. 338-355.
Addressing, Distances and Routing in Triangular Systems with.. - Chepoi, al. (2004) (Correct)
No context found.
D. Harel, R. Tarjan, Fast algorithms for finding nearest common ancestor, SIAM J. Comput., vol. 13, pp. 338--355, 1984.
On Matching Nodes Between Trees - Zhang (2003) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13:338--355, 1984.
A Uniform Approach to Semi-Dynamic Problems on Digraphs - Cicerone, Frigioni.. (1998) (1 citation) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984.
A Fully Dynamic Reachability Algorithm for Directed Graphs.. - Roditty, Zwick (2004) (Correct)
No context found.
D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13, 1984.
Maintaining Hierarchical Graph Views for Dynamic Graphs - Raitner (2004) (Correct)
No context found.
Dov Harel and Robert Endre Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13(2):338--355, 1984.
An O(ND) Difference Algorithm and Its Variations - Myers (1986) (12 citations) (Correct)
No context found.
Harel, D. and Tarjan, R.E. "Fast Algorithms for Finding Nearest Common Ancestors." SIAM Journal on Computing 13, 2 (1984), 338-355.
XRANK: Ranked Keyword Search over XML Documents - Lin Guo Feng (2003) (24 citations) (Correct)
No context found.
D. Harel, H. E. Tarjan, "Fast Algorithms for finding nearest common ancestors", SIAM J. of Computing, vol. 13, 1984.
Efficient Algorithms for Single Link Failure Recovery and.. - Bhosle, Gonzalez (2003) (Correct)
No context found.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SICOMP, 13(2), pages 338-355, 1984.
Topological Grayscale Watershed Transformation - Michel Couprie And (1997) (1 citation) (Correct)
No context found.
D. Harel, R.E. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors", SIAM J. Comput., Vol. 13, No. 2, pp. 338-355, 1984.
Constructing Control Flow from Control Dependence - Ball, Horwitz (1992) (3 citations) (Correct)
No context found.
D. Harel and R. E. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors," SIAM Journal of Computing 13(2)Society for Industrial and Applied Mathematics, (May 1984).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC