Advocating ownership

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1180, Issue , 1996, Pages 286-297

  Fernau, Henning ^a   Lange, Klaus Jörn ^a   Reinhardt, Klaus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

PUSH-DOWN AUTOMATA;

SOFTWARE ENGINEERING;

EID: 84947916176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_57     Document Type: Conference Paper

References (24)

1. J. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity Theory I. Springer, 1988.
2. J. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity Theory II. Springer, 1990.
3. S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. Assoc. Comp. Mach., 18:4-18, 1971.
4. S. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Symp. on Theory of Computing, pages 338-345, 1979.
5. P. Dymond and S. Cook. Complexity theory of parallel time and hardware. Inform, and Control, 80:201-226, 1989.
6. P. Dymond and W. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recoginition. In Proc. of the 13th ICALP, number 226 in LNCS, pages 95-104. Springer, 1986.
7. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 114-118, 1978.
8. L. M. Goldschlager. A unified approach to models of synchronous parallel computation. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 89-94, 1978.
9. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading Mass., 1979.
10. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 67-161. Elsevier, Amsterdam, 1990.
11. K.-J. Lange. Unambiguity of circuits. Theoret. Comput. Sci., 107:77-94, 1993.
12. K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. In Proc. of the 15th MFCS, number 452 in LNCS, pages 399-406. Springer, 1990.
13. K.-J. Lange and P. Rossmanith. Unambiguous polynomial hierarchies and exponential size. In Proc. of the 9th IEEE Structure in Complexity Conference, pages 106-115, 1994.
14. 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.
15. R. Niedermeier and P. Rossmanith. Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Inform, and Control, 118(2):227-245, 1995.
16. I. Niepel and P. Rossmanith. Uniform circuits and exclusive read PRAMs. In Proc. of the 11th FST&TCS, number 560 in LNCS, pages 307-318. Springer, 1990.
17. K. Reinhardt. Strict sequential P-completeness. Manuscript, 1996.
18. P. Rossmanith. The owner concept for PRAMs. In Proc. of the 8th STACS, number 480 in LNCS, pages 172-183. Springer, 1991.
19. P. Rossmanith. Characterizations of memory access for PRAM's and bounds on the time complexity of boolean functions. Ph.D. thesis, Technische Universität München, 1993.
20. W. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365-338, 1981.
21. L. Stockmeyer and C. Vishkin. Simulation of random access machines by circuits. SIAM J. Comp., 13:409-422, 1984.
22. I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405-414, 1978.
23. H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of the 19th Annual ACM Symp. on Theory of Computing, pages 141-150, 1987.
24. J. Vogel and K. Wagner. Two-way automata with more than one storage medium. Theoret. Comput. Sci., 39:267-280, 1985.