Some separation results between classes of pointer algorithms

8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006 - Proceedings

Volumn , Issue , 2006, Pages 232-240

  Cloteaux, Brian ^a   Ranjan, Desh ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISPERSION COMPENSATION;

COMPUTATIONAL POWER; SPACE USAGE; STANDING PROBLEMS;

ALGORITHMS;

EID: 37849021543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Amir M. Ben-Amram. What is a "pointer machine"? SIGACT News, 26(2):88-95, 1995.
2. Gerth S. Brodal, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, and Kostas Tsichlas. Optimal solutions for the temporal precedence problem. Algorithmica, 33(4):494-510, 2002.
3. Alessandro Dal Paĺu, Enrico Pontelli, and Desh Ranjan. An optimal algorithm for finding NCA on pure pointer machines. In SWAT '02: Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, pages 428-438. Springer-Verlag, 2002. LNCS 2368.
4. Reinhard Diestel. Graph theory (2nd edition). Springer-Verlag, 2000.
5. D. Yu. Grigoriev. Kolmogorov algorithms are stronger than Turing machines. Journal of Soviet Mathematics, 14(5):1445-1450, 1980.
6. Yuri Gurevich. On Kolmogorov machines and related issues. Bulletin of the European Association for Theoretical Computer Science, 35:71-82, 1988.
7. Bala Kalyanasundaram and Georg Schnitger. Communication complexity and lower bounds for sequential computation. In Informatik - Festschrift zum 60. Geburtstag von Günter Hotz, pages 253-268. Teubner Verlag, 1992.
8. A. N. Kolmogorov and V. A. Uspenskii. On the definition of an algorithm. American Mathematical Society Translations - Series 2, 29:217-245, 1963.
9. Han La Poutré. Lower bounds for the union-find and the split-find problem on pointer machines. Journal of Computer System Science, 52(1):87-99, 1996.
10. David Luginbuhl and Michael Loui. Hierarchies and space measures for pointer machines. Information and Computation, 104:253-270, 1993.
11. Enrico Pontelli and Desh Ranjan. A simple optimal solution for the temporal precedence problem on pure pointer machines. Theory of Computing Systems, 38(1):115- 130, 2005.
12. Desh Ranjan, Enrico Pontelli, and Gopal Gupta. Efficient algorithms for the temporal precedence problem. Information Processing Letters, 68(2):71-78, 1998.
13. Desh Ranjan, Enrico Pontelli, Gopal Gupta, and Luc Longpré. The temporal precedence problem. Algorithmica, 28(3):288-306, 2000.
14. A. Schönhage. Storage modification machines. SIAM Journal on Computing, 9(3):490-508, 1980.
15. Konstantin V. Shvachko. Different modifications of pointer machines and their computational power. In Proceedings of Symposium of the Mathematical Foundations of Computer Science MFCS 1991, pages 426-435. Springer-Verlag, 1991. LNCS 520.
16. Robert E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, 77:110-127, 1979.
17. Peter van Emde Boas. Space measures for storage modification machines. Information Processing Letters, 30:103-110, 1989.