Skip to main content
SpringerLink
Log in

Communication complexity of computing a collection of rational functions

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abelson, H., “Towards a Theory of Local and Global Computation”, Theoretical Computer Science, Vol. 6, 1978, pp. 41–67.

    Google Scholar 

  2. Abelson, H., “Lower Bounds on Information Transfer in Distributed Computations”, Journal of ACM, 27, 2, 1980, pp. 384–392.

    Google Scholar 

  3. Borodin, A. and Munro, I., The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.

    Google Scholar 

  4. Chen, P., “Communicational Complexity of Distributed Computations”, preprint, 1989.

    Google Scholar 

  5. Ja'Ja, J., “The VLSI Complexity of Selected Graph Problems”, Journal of ACM, Vol. 31, No. 2, 1984, pp. 377–391.

    Google Scholar 

  6. Lipton, R.J. and Sedgewick, R., “Lower Bounds for VLSI”, Proceedings of 13th STOC, 1981, pp. 300–307.

    Google Scholar 

  7. Luo, Z.Q., Communication Complexity of Some Problems in Distributed Computation, Ph.D dissertation, technical report LIDS-TH-1909, Lab. for Information and Decision Systems, MIT, Cambridge, Mass., 1989.

    Google Scholar 

  8. Luo, Z.Q. and Tsitsiklis, J.N., “On the Communication Complexity of Distributed Algebraic Computation”, technical report LIDS-P-1851, Lab. for Information and Decision Systems, MIT, Cambridge, Mass., 1989.

    Google Scholar 

  9. Luo, Z.Q. and Tsitsiklis, J.N., “On the Communication Complexity of Solving a Polynomial Equation”, technical report LIDS-P-1876, Lab. for Information and Decision Systems, MIT, Cambridge, Mass., 1989.

    Google Scholar 

  10. Papadimitriou, C.H. and Sipser, M., “Communication Complexity”, Proceedings of the 14th STOC, 1982, pp. 196–200.

    Google Scholar 

  11. Tenney, R.R. and Sandell, N.R. Jr., “Detection with Distributed Sensors”, IEEE Transaction on Aerospace and Electronic Systems, AES-17, 4, 1981, pp. 501–510.

    Google Scholar 

  12. Tsitsiklis, J.N. and Luo, Z.Q., “Communication Complexity of Convex Optimization”, Journal of Complexity, Vol. 3, pp. 231–243, 1987.

    Google Scholar 

  13. Van Der Waerden, B.L., Modern Algebra, Vol. 1 & 2, Frederick Ungar Publishing Co., New York, 1953.

    Google Scholar 

  14. Yao, A.C., “Some Complexity Questions Related to Distributed Computing”, Proceedings of the 11th STOC, 1979, pp. 209–213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, McMaster University, L8S 4L7, Hamilton, Ontario, Canada

    Zhi-Quan Luo

Authors
  1. Zhi-Quan Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, ZQ. (1991). Communication complexity of computing a collection of rational functions. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation