An optimal algorithm for finding NCA on pure pointer machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 428-438

  Dal Palu A ^a   Pontelli, E ^a   Ranjan, D ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ARITHMETIC CAPABILITY; COMPRESSION SCHEME; EFFICIENT SCHEMES; OPTIMAL ALGORITHM; POINTER MACHINES;

ALGORITHMS;

EID: 84943311507     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45471-3_44     Document Type: Article

References (16)

1. S. Alstrup and M. Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Journal of Algorithms, 35:169-188, 2000.
2. A.M. Ben-Amram. What is a Pointer Machine? In SIGACT News, 26(2), 1995.
3. M.A. Bender and M. Farach-Colton. The LCA Problem Revisited. In Proceedings of LATIN 2000, pages 88-94. Springer Verlag, 2000.
4. A.L. Buchsbaum et al. Linear-Time Pointer-Machine Algorithms for Least Common Ancestors. In Procs. ACM STOC, ACM Press, 1998.
5. R. Cole and R. Hariharan. Dynamic LCA Queries on Trees. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 235-244. ACM/SIAM, 1999.
6. A. Dal Palù, E. Pontelli, D. Ranjan. An Optimal Algorithm for Finding NCA on Pure Pointer Machines. NMSU-TR-CS-007/2001, www.cs.nmsu.edu, 2001.
7. H.N. Gabow and R. E. Tarjan A linear-time algorithm for a special case of disjoint set union J. Comput. System Sci 30 (1985), 209-221.
8. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge Press, 1999.
9. D. Harel and R.E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13(2):338-355, 1984.
10. E. Pontelli and D. Ranjan. A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines. TR-CS-006/2001, New Mexico State U., 2001.
11. E. Pontelli and D. Ranjan. Ancestor Problems on Pure Pointer Machines. In LATIN, 2002.
12. D. Ranjan et al. An Optimal Data Structure to Handle Dynamic Environments in Non-deterministic Computations. Computer Languages, (to appear).
13. D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta. The Temporal Precedence Problem. Algorithmica, 28:288-306, 2000.
14. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors. SIAM J. Comp., 17:1253-1262, 1988.
15. A. Tsakalidis. Maintaining Order in a Generalized Linked List. ACTA Informatica, (21):101-112, 1984.
16. A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree. ACTA Informatica, 25:37-54, 1988.