RUSPACE(log n) ⊆ DSPACE(log2 n/log log n)

Theory of Computing Systems

Volumn 31, Issue 5, 1998, Pages 539-550

  Allender, E ^a   Lange, K J ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

BOUNDED ALGORITHMS; CONNECTIVITY PROBLEMS; D-SPACE; DETERMINISTIC ALGORITHMS; POINTER MACHINES; RUNNING-IN;

COMPUTER SCIENCE;

EID: 0038911876     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000102     Document Type: Article

References (26)

1. R. J. Anderson and G. L. Miller. Deterministic parallel list ranking. In VLSI Algorithms and Architectures, Proc. 3rd Aegean Workshop on Computing, number 319 in LNCS, pages 81-90. Springer-Verlag, Berlin, 1988.
2. 4/3. In Proc. of the 29th Annual ACM Symposium on Theory of Computing, pages 230-239, 1997.
3. A. Blass and Y. Gurevich. On the unique satisfiability problem. Inform. and Control, 55:80-88, 1982.
4. G. Buntrock, B. Jenner, K.-J. Lange, and P. Rossmanith. Unambiguity and fewness for logarithmic space. In Proc. of the 8th Conference on Fundamentals of Computation Theory, number 529 in LNCS, pages 168-179. Springer-Verlag, Berlin, 1991.
5. R. Cole and U. Vishkin. Approximate parallel scheduling, part I: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comput., 17:128-142, 1988.
6. S. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Symposium on Theory of Computing, pages 338-345, 1979.
7. S. Cook and P. Dymond. Parallel pointer machines. Comput. Complexity, 3:19-30, 1993.
8. P. Dymond and W. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recognition. In Proc. of the 13th International Colloquium on Automata, Languages and Programming, number 226 in LNCS, pages 95-104. Springer-Verlag, Berlin, 1986.
9. M. Fellows and N. Koblitz. Self-witnessing polynomial-time complexity and prime factorization. In Proc. of the 7th IEEE Structure in Complexity Conference, pages 107-110, 1992.
10. H. Fernau, K.-J. Lange, and K. Reinhardt. Advocating ownership. In Proc. of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, number 1180 in LNCS, pages 286-297. Springer-Verlag, Berlin, 1996.
11. A. Gál and A. Wigderson. Boolean vs. arithmetic complexity classes: randomized reductions. Random Structures Algorithms, 9:99-111, 1996.
12. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, MA, 1979.
13. N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17:935-938, 1988.
14. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th IEEE Structure in Complexity-Theory Conference, pages 102-111, 1993.
15. R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 869-941. Elsevier, Amsterdam, 1990.
16. T. Lam and W. Ruzzo. The power of parallel pointer manipulation. In Proc. of the 1st ACM Symposium on Parallel Algorithms and Architectures (SPAA '89), pages 92-102, 1989.
17. K.-J. Lange. An unambiguous class possessing a complete set. In Proc. of the 14th STACS, number 1200 in LNCS, pages 339-350. Springer-Verlag, Berlin, 1997.
18. K.-J. Lange and R. Niedermeier. Data-independences of parallel random access machines. In Proc. of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, number 761 in LNCS, pages 104-113. Springer-Verlag, Berlin, 1993.
19. B. Monien, W. Rytter, and H. Schäpers. Fast recognition of deterministic cfl's with a smaller number of processors. Theoret. Comput. Sci., 116:421-429, 1993. Corrigendum, 123:427, 1993.
20. B. Monien, W. Rytter, and H. Schäpers. Fast recognition of deterministic cfl's with a smaller number of processors. Theoret. Comput. Sci., 116:421-429, 1993. Corrigendum, 123:427, 1993.
21. N. Nisan. RL ⊆ SC. Comput. Complexity, 4:1-11, 1994.
22. K. Reinhardt. Personal communication.
23. K. Reinhardt and E. Allender. Making nondeterminism unambiguous. In Proc. of the 38tH Annual IEEE Symposium on Foundations of Computer Science, pages 244-253, 1997.
24. P. Rossmanith. The owner concept for PRAMs. In Proc. of the 8th STACS, number 480 in LNCS, pages 172-183. Springer-Verlag, Berlin, 1991.
25. I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comput. Mach., 25:405-414, 1978.
26. R. Szelepcsényi. The method of forcing for nondeterministic automata. Acta Inform., 26:279-284, 1988.