The communication complexity of the two list problem
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 . 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.
Unable to display preview. Download preview PDF.
- “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
- Alon, N., O. Goldreich, J. Hastead and R. Peralta, “Simple construction of almost k-wise independent random variables”. FOCS 90.Google Scholar
- Carter, J. L., and M. N. Wegman, “Universal classes of hash functions,” JCSS 18, 143–154 (1979).Google Scholar
- Duris, P., and Z. Galil. “Two lower bounds in asynchronous distributed computation,” 28 FOCS, 326–330, (1987).Google Scholar
- 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
- Fürer, M., “The power of randomness for communication complexity,” STOC 1987, 178–181.Google Scholar
- Melhorn, K., and E.M. Schmidt, “Las Vegas is better than determinism in VLSI and distributed computing,” STOC 1982, 330–337.Google Scholar
- Luby, M., “A simple parallel algorithm for the maximal independent set problem”, SIAM J. Computing, 15 (1986), 1036–1053.Google Scholar
- Melhorn, K., Data structures and Algorithms 1: Sorting and Searching EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.Google Scholar
- 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
- Newman, I., “Communication complexity in the private random bits model is no harder than in the common bits model,” unpublished manuscript, 1990.Google Scholar
- O'Reilly, U-M., and N. Santoro, “The expressiveness of silence”, unpublished communication, (1991).Google Scholar
- Papadimitriou, C. H., and M. Sipser, “Communication complexity”, Fourteenth ACM Symposium on the Theory of Computing, 196–200, (1982).Google Scholar