The temporal precedence problem

Algorithmica (New York)

Volumn 28, Issue 3, 2000, Pages 288-306

  Ranjan, D ^a   Pontelli, E ^a   Gupta, G ^a   Longpre, L ^b  

^a New Mexico State University   (United States)

^b University of Texas at El Paso   (United States)

Author keywords

Algorithms; Complexity; Dynamic data structures; Lower bounds; Pointer machines

Indexed keywords

EID: 0011762346     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010036     Document Type: Article

References (18)

1. A. Tsakalidis. Maintaining Order in a Generalized Linked List. ACTA Informatica, 21 (1984), 101-112.
2. P. F. Dietz and D. D. Sleator. Two Algorithms for Maintaining Order in a List. In Proceedings of the Symposium on Theory of Computing, ACM Press, New York, 1987, pp. 365-372.
3. E. Pontelli, D. Ranjan, and G. Gupta. On the Complexity of Parallel Implementation of Logic Programs. In Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Verlag, New York, 1997, pp. 123-137.
4. D. E. Knuth. The Art of Computer Programming, Volume 1. Addison-Wesley, Reading, MA, 1968.
5. R. E. Tarjan. A Class of Algorithms which Require Nonlinear Time to Mantain Disjoint Sets. Journal of Computer and System Sciences, 18 (1979), 110-127.
6. B. Chazelle. A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM Journal of Computing, 17 (1988), 427-462.
7. A. N. Kolmogorov and V. A. Uspenskii. On the Definition of an Algorithm. Uspekhi Matematicheskikh Nauk, 13 (1958), 217-245.
8. A. Schönhage. Storage Modification Machines. SIAM Journal of Computing, 9 (1980), 490-508.
9. A. M. Ben-Amram. What is a Pointer Machine? Technical report, DIKU, University of Copenhagen, 1995.
10. N. Blum. On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM Journal on Computing, 15 (1986), 1021-1024.
11. H. LaPoutré. Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines. Journal of Computer and System Sciences, 52 (1996), 87-99.
12. A. K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree. ACTA Informatica, 25 (1987), 37-54.
13. D. Harel and R. E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13 (1984), 338-355.
14. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory, 10 (1977), 99-127.
15. K. Mehlhorn and S. Naher. Dynamic Fractional Cascading. Algorithmica, 5 (1990), 215-241.
16. K. Mehlhorn, S. Naher, and H. Alt. A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal of Computing, 17 (1988), 1093-1102.
17. P. Erdös and R. Rado. Intersection Theorems for Systems of Sets. Journal of the London Mathematical Society, 35 (1960), 85-90.
18. E. Pontelli and G. Gupta. Implementation Mechanisms for Dependent And-Parallelism. In Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA, 1997, pp. 123-137.