A simple optimal solution for the temporal precedence problem on pure pointer machines

Theory of Computing Systems

Volumn 38, Issue 1, 2005, Pages 115-130

  Pontelli, Enrico ^a   Ranjan, Desh ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CAPABILITY; LINEAR SPACES; OPTIMAL SOLUTIONS; POINTER MACHINES;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

OPTIMAL SYSTEMS;

EID: 24044551590     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1118-x     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? SIGACT News, 26(2):88-95, June 1995.
3. G.S. Brodal, C. Makris, S. Sioutas, A.K. Tsakalidis, and K. Tsichlas. Optimal Solutions for the Temporal Precedence Problem. Algorithmica, 33(4):494-510, 2002.
4. B. Chazelle. A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM Journal of Computing, 17(3):427-462, 1988.
5. P.F. Dietz and D.D. Sleator. Two Algorithms for Maintaining Order in a List. In Proceedings of the Symposium on Theory of Computing, pages 365-372. ACM Press, New York, 1987.
6. D. Harel and R.E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13(2):338-355, 1984.
7. D.E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, Reading, MA, 1968.
8. H. LaPoutré. Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines. Journal of Computer and System Sciences, 52:87-99, 1996.
9. M. Overmars and J. van Leeuwen. Worst Case Optimal Insertion and Deletion Methods for Decomposable Search Problems. Information Processing Letters, 12:168-173, 1981.
10. E. Pontelli, D. Ranjan, and G. Gupta. On the Complexity of Parallel Implementation of Logic Programs. In S. Ramesh and G. Sivakumar, editors, Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science, pages 123-137. Springer-Verlag, Heidelberg, 1997.
11. D. Ranjan, E. Pontelli, and G. Gupta. Efficient Algorithms for the Temporal Precedence Problem. Information Processing Letters, 68:71-78, 1998.
12. D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta. The Temporal Precedence Problem. Algorithmica, 28:288-306, 2000.
13. A. Schönhage. Storage Modification Machines. SIAM Journal of Computing, 9(3):490-508, August 1980.
14. R.E. Tarjan. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. Journal of Computer and System Sciences, 2(18):110-127, 1979.
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:31-54, 1988.