Skip to main content
SpringerLink
Log in

The communication complexity of the two list problem

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1991)

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

Included in the following conference series:

  • 122 Accesses

Abstract

Let L and R be processors, each containing the n numbers x1,..., xn and y1,..., yn respectively, where each number consists of n bits. Their task is to determine whether there exists an i such that xi=yi. This problem requires Ω(n2) bits for deterministic algorithms [7]. Here a simple O(n) expected bit randomized (Las Vegas) algorithm is suggested. Its properties depend on the properties of universal hash functions, not on prime numbers or finite fields. Then the number of random bits is reduced by a general construction. Finally, practical algorithms using almost independent strings are presented.

Supported by Technion V.P.R. - E. & J. Bishop Research Fund.

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. “A fast and simple randomized parallel algorithm for the maximal independent set problem”. Alon, N., L. Babai, A. Itai, J. Algorithms, 7, 567–583, (1986).

    Google Scholar 

  2. Alon, N., O. Goldreich, J. Hastead and R. Peralta, “Simple construction of almost k-wise independent random variables”. FOCS 90.

    Google Scholar 

  3. Carter, J. L., and M. N. Wegman, “Universal classes of hash functions,” JCSS 18, 143–154 (1979).

    Google Scholar 

  4. Duris, P., and Z. Galil. “Two lower bounds in asynchronous distributed computation,” 28 FOCS, 326–330, (1987).

    Google Scholar 

  5. Fleischer, R., H. Jung, and K. Melhorn, “A time-randomness tradeoff for communication complexity”, WDAG 4, Otranto, Italy, (1990). Lecture Notes in Computer Science 486, J. van Leewen and N. Santoro, (eds.), Springer-Verlag.

    Google Scholar 

  6. Fürer, M., “The power of randomness for communication complexity,” STOC 1987, 178–181.

    Google Scholar 

  7. Melhorn, K., and E.M. Schmidt, “Las Vegas is better than determinism in VLSI and distributed computing,” STOC 1982, 330–337.

    Google Scholar 

  8. Luby, M., “A simple parallel algorithm for the maximal independent set problem”, SIAM J. Computing, 15 (1986), 1036–1053.

    Google Scholar 

  9. Melhorn, K., Data structures and Algorithms 1: Sorting and Searching EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.

    Google Scholar 

  10. Naor, J., and M. Naor, “Small-bias probability spaces: Efficient construction and applications”, 22nd ACM Symposium on the Theory of Computing, 213–223, (1990).

    Google Scholar 

  11. Newman, I., “Communication complexity in the private random bits model is no harder than in the common bits model,” unpublished manuscript, 1990.

    Google Scholar 

  12. O'Reilly, U-M., and N. Santoro, “The expressiveness of silence”, unpublished communication, (1991).

    Google Scholar 

  13. Papadimitriou, C. H., and M. Sipser, “Communication complexity”, Fourteenth ACM Symposium on the Theory of Computing, 196–200, (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Technion, 32000, Haifa, Israel

    Alon Itai

Authors
  1. Alon Itai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sam Toueg Paul G. Spirakis Lefteris Kirousis

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Itai, A. (1992). The communication complexity of the two list problem. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022447

Download citation

  • DOI: https://doi.org/10.1007/BFb0022447

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55236-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation