Advertisement

Methods in parallel algorithmics and who may need to know them?

  • Uzi Vishkin
Session 1: Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ALM-90]
    S. Arora, T. Leighton and B. Maggs. On-line algorithms for path selection in a nonblocking network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pages 149–158, 1990.Google Scholar
  2. [GMV-91]
    Y. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd IEEE Annual Symp. on Foundation of Computer Science, pages 698–710, 1991.Google Scholar
  3. [HP-90]
    J.L. Hennessy and D.A. Patterson. Computer Architecture a Quantitative Approach. Morgan Kaufmann, San Mateo, California, 1990.Google Scholar
  4. [J-92]
    J. JáJá. Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.Google Scholar
  5. [KU-86]
    A. Karlin and E. Upfal. Parallel hashing — an efficient implementation of shared memory. In Proc. of the 18th Ann. ACM Symp. on Theory of Computing, pages 160–168, 1986.Google Scholar
  6. [L-92a]
    F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, California, 1992.Google Scholar
  7. [L-92b]
    F.T. Leighton. Methods for message routing in parallel machines. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 77–96, 1992.Google Scholar
  8. [MR-90]
    M. Metcalf and J. Reid. Fortran 90 Explained. Oxford University Press, New York, 1990.Google Scholar
  9. [MV-84]
    K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339–374, 1984.CrossRefGoogle Scholar
  10. [R-87]
    A.G. Ranade. How to emulate shared memory. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 185–194, 1987.Google Scholar
  11. [R-92]
    J.H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, California, 1992.Google Scholar
  12. [U-89]
    E. Upfal. An O(log N) deterministic packet routing scheme. In Proc. of the 21st Ann. ACM Symp. on Theory of Computing, pages 241–250, 1989.Google Scholar
  13. [V-84]
    U. Vishkin. A parallel-design distributed-implementation (PDDI) general purpose computer. Theoretical Computer Science, 32:157–172, 1984.CrossRefGoogle Scholar
  14. [V-91a]
    U. Vishkin. Structural parallel algorithmics. In Proc. of the 18th Int. Colloquium on Automata, Languages and Programming, pages 363–380, 1991, Lecture Notes in Computer Science 510, Springer-Verlag.Google Scholar
  15. [V-91b]
    U. Vishkin. Can parallel algorithms enhance serial implementation? TR-91-145, University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, Maryland 20742–3251, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Uzi Vishkin
    • 1
  1. 1.University of Maryland & Tel Aviv UniversityUSA

Personalised recommendations