Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1993: STACS 93 pp 386–397Cite as

Limits on the power of parallel random access machines with weak forms of write conflict resolution

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 665))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Borodin, J. Hopcroft, M. Paterson, L. Ruzzo, and M. Tompa, “Observations Concerning Synchronous Parallel Models of Computation”, manuscript, 1980.

    Google Scholar 

  2. S. Cook, C. Dwork, and R. Reischuk, “Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes”, SIAM J. Comput., volume 15, 1986, pages 87–97.

    Google Scholar 

  3. M. Dietzfelbinger, M. Kutyłowski, and R. Reischuk, “Exact Time Bounds for Computing Boolean Functions without Simultaneous Writes”, Proc. Second Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pages 125–135.

    Google Scholar 

  4. D. Eppstein and Z. Galil, “Parallel Algorithmic Techniques for Combinatorial Computing”, Ann. Rev. Comput. Sci., volume 3, 1988, pages 233–283.

    Google Scholar 

  5. F. Fich, P. Ragde, and A. Wigderson, “Relations Between Concurrent-Write Models of Parallel Computation”, SIAM J. Comput., volume 17, 1988, pages 606–627.

    Google Scholar 

  6. P. Fischer, and H. U. Simon, “On Learning Ring-Sum-Expansions”, Proc. Third Workshop on Computational Learning Theory, 1990, to appear in SIAM J. Comput.

    Google Scholar 

  7. S. Fortune and J. Wyllie, “Parallelism in Random Access Machines”, Proc. 10th Annual Symposium on Theory of Computing, 1978, pages 114–118.

    Google Scholar 

  8. L. Goldschlager, “A Unified Approach to Models of Synchronous Parallel Machines”, JACM, volume 29, 1982, pages 1073–1086.

    Google Scholar 

  9. V. Grolmusz and P. Ragde, “Incomparability in Parallel Computation”, Discrete Applied Mathematics, volume 29, no. 1, 1990, pages 63–78.

    Google Scholar 

  10. T. Hagerup, “Fast and Optimal Simulations between CRCW PRAMs”, Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science, 1992, pages 45–48.

    Google Scholar 

  11. T. Hagerup, personal communication.

    Google Scholar 

  12. T. Hagerup and T. Radzik, “Every Robust CRCW PRAM can Efficiently Simulate a PRIORITY PRAM”, Proc. Second Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pages 117–124.

    Google Scholar 

  13. L. Kucera, “Parallel Computation and Conflicts in Memory Access”, Information Processing Letters, volume 14, 1982, pages 93–96.

    Google Scholar 

  14. R. Smolensky, “Algebraic methods in the theory of lower bounds for Boolean circuit complexity”, Proc. 19th Annual ACM Symposium on Theory of Computing, 1987, pages 77–82.

    Google Scholar 

Download references

Author information

Author notes

  1. Russell Impagliazzo

    Present address: University of California, San Diego

  2. Bruce Kapron & Valerie King

    Present address: University of Victoria, Canada

  3. Miroslaw Kutylowski

    Present address: Uniwersytet Wroclaw, Poland

Authors and Affiliations

  1. University of Toronto, Canada

    Faith E. Fich, Russell Impagliazzo, Bruce Kapron & Valerie King

  2. Heinz Nixdorf Institut, Universität Paderborn, Germany

    Miroslaw Kutylowski

Authors
  1. Faith E. Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Russell Impagliazzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruce Kapron
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valerie King
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Miroslaw Kutylowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fich, F.E., Impagliazzo, R., Kapron, B., King, V., Kutylowski, M. (1993). Limits on the power of parallel random access machines with weak forms of write conflict resolution. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation