Uniform circuits and exclusive read PRAMs

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

Volumn 560 LNCS, Issue , 1991, Pages 307-318

  Niepel, Inga ^a   Rossmanith, Peter ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; TIMING CIRCUITS;

CARTESIAN PRODUCTS; EREW PRAM; FAN OUT; MEMORY ACCESS; NOT GATE; UNIFORM CIRCUITS;

SOFTWARE ENGINEERING;

EID: 26444603343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54967-6_77     Document Type: Conference Paper

References (23)

1. A. K. Chandra, L. J. Stockmeyer, and U. Vishkin. A complexity theory for unbounded fan-in parallelism. In Proc. of 23rd IEEE Symposium on Foundations of Computer Science, pages 1-13, 1982.
2. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985.
3. P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th International Colloquium on Automata, Languages and Programming, number 226 in Lecture Notes in Computer Science, pages 95-104. Springer, 1986.
4. D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci., 3:233-283, 1988.
5. F. E. Fich, P. Ragde, and A. Wigderson. Relationships between concurrent write models of parallel computation. In Proc. 3rd Annual A CM Symposium on Principles of Distributed Computing, pages 179-189, 1984.
6. S. Fortune and J. Willie. Parallelism in random access machines. In Proc. of 10th ACM Symposium on Theory of Computing, pages 114-118, 1978.
7. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989.
8. L. M. Goldschlager. A universal interconnection pattern for parallel computers. Journal of the ACM, 29(3):1073-1086, 1982.
9. T. Hagerup. Optimal parallel algorithms on planar graphs. Information and Computation, 84:71-96, 1990.
10. J. Hastad. Almost optimal lower bounds for small depth circuits. In Proc. of 18th ACM Symposium on Theory of Computing, pages 6-20, May 1986.
11. H. J. Hoover, M. M. Klawe, and N. J. Pippenger. Bounding fan-out in logical networks. Journal of the ACM, 31:13-18, 1984.
12. 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, chapter 17, pages 869-932. Elsevier, 1990.
13. K.-J. Lange. Unambiguity of circuits. In Proc. of 5th Conference on Structure in Complexity Theory, pages 130-137, 1990. (to appear in TCS).
14. K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. In Proc. of 15th Symposium on Mathematical Foundations of Computer Science, number 452 in Lecture Notes in Computer Science, pages 399-406. Springer, 1990.
15. I. Niepel and P. Rossmanith. Uniform Circuits and Exclusive Read PRAMs. SFB-Bericht 342/31/90 A, 19055, Institut für Informatik, Technische Universität München, December 1990.
16. I. Parberry. Parallel Complexity Theory. Pitman, 1987.
17. P. Rossmanith. The owner concept for PRAMs. In Proc. of 8th Symposium on Theoretical Aspects of Computer Science, number 480 in Lecture Notes in Computer Science, pages 172-183. Springer, 1991.
18. W. L. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21:218-235, 1980.
19. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365-383, 1981.
20. J. T. Schwarz. Ultracomputers. ACM TOPLAS, 2(4):484-521, 1980.
21. M. Sriir. On parallel searching. In Proc. SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 242-253, Ottawa, Canada, 1982.
22. L. Stockmeyer and U. Vishlcin. Simulation of parallel random access machines by circuits. SIAM Journal on Computing, 13(2):409-422, May 1984.
23. U. Vishkin. Implementation of simultaneous memory address access in models that forbid it. Journal of Algorithms, 4:45-50, 1983.