The power of parallel pointer manipulation

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 92-102

  Lam, Tak Wah ^a   Ruzzo, Walter L ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ARITHMETIC CAPABILITY; CONSTANT FACTORS; FINITE STATE; PARALLEL MACHINE;

PARALLEL ARCHITECTURES;

EID: 85029453593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72946     Document Type: Conference Paper

References (17)

1. A. M. Ben-Amram and Galil Z. On pointers versus addresses. In Proceedings of the Twenty Ninth Annual Symposium on Foundations of Computer Science, pages 532-538. IEEE, October 1988.
2. S. A. Cook. Towards a complexity theory of synchronous parallel computation. L'Enseignement Mathematique, 27(1-2):75- 100, 1981.
3. Patrick W. Dymond and Steven A. Cook. Hardware complexity and parallel computation. In 21st Annual Symposium on Foundations of Computer Science, pages 360-372, Syracuse, New York, October 1980.
4. Patrick W. Dymond and Steven A. Cook. Complexity theory of parallel time and hardware. Information and Computation, 80(3):205-226, March 1989.
5. Patrick W. Dymond and Walter L. Ruzzo. Parallel random access machines with owned global memory and deterministic context-free language recognition. In Laurent Kott, editor, 13th International Colloquium on Automata, Languages, and Programming, pages 95-104. Springer-Verlag, July 1986. Lecture Notes in Computer Science, volume 226.
6. P.W. Dymond. Simultaneous Resource Bounds and Parallel Computation. PhD thesis, Univ. of Toronto, August 1980. TR 145/80.
7. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 114-118, San Diego, California, May 1978.
8. J. Y. Halpern, M. C. Loui, A. R. Meyer, and D. Weise. On time versus space III. Mathematical Systems Theory, 19:13-28, 1986.
9. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, May 1984.
10. J.W. Hong. Similarity and duality in computation. Information and Control, 62:109-128, 1984.
11. G. Lev, N. Pippenger, and L.G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers, C-30(2):93-100, February 1981.
12. D. R. Luginbuhl and M. C. Loui. Hierarchies and space measures for pointer machines. Technical Report UILU-ENG-88-2245, Univ. of Illinois, Coordinated Science Laboratory, August 1988.
13. N. Nisan. CREW-PRAMs and decision trees. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 1989. To appear.
14. N. Pippenger. On simultaneous resource bounds. In 20th FOCS, pages 307-311, 1979.
15. Walter L. Ruzzo. On uniform circuit complexity. JCSS, 22(3):365-383, June 1981.
16. A. Schonhage. Storage modification machines. SLAM Journal on Computing, 9(3):490-508, August 1980.
17. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, 18:110-127, 1979.