On Finding Lowest Common Ancestors in Trees
- 1 March 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (1) , 115-132
- https://doi.org/10.1137/0205011
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Fast algorithms for the elimination of common subexpressionsActa Informatica, 1973
- Algorithm 430 [H]: Immediate predominators in a directed graphCommunications of the ACM, 1972
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- A global flow analysis algorithmInternational Journal of Computer Mathematics, 1972
- Control flow analysisACM SIGPLAN Notices, 1970
- Global common subexpression eliminationACM SIGPLAN Notices, 1970
- Object code optimizationCommunications of the ACM, 1969