Abstract
We consider the communication complexity of fundamental longest common prefix \(({{\mathrm{\textsc {Lcp}}}})\) problems. In the simplest version, two parties, Alice and Bob, each hold a string, A and B, and we want to determine the length of their longest common prefix \(\ell ={{\mathrm{\textsc {Lcp}}}}(A,B)\) using as few rounds and bits of communication as possible. We show that if the longest common prefix of A and B is compressible, then we can significantly reduce the number of rounds compared to the optimal uncompressed protocol, while achieving the same (or fewer) bits of communication. Namely, if the longest common prefix has an LZ77 parse of z phrases, only \(O(\lg z)\) rounds and \(O(\lg \ell )\) total communication is necessary. We extend the result to the natural case when Bob holds a set of strings \(B_1, \ldots , B_k\), and the goal is to find the length of the maximal longest prefix shared by A and any of \(B_1, \ldots , B_k\). Here, we give a protocol with \(O(\log z)\) rounds and \(O(\lg z \lg k + \lg \ell )\) total communication. We present our result in the public-coin model of computation but by a standard technique our results generalize to the private-coin model. Furthermore, if we view the input strings as integers the problems are the greater-than problem and the predecessor problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: The sketching complexity of pattern matching. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX/RANDOM -2004. LNCS, vol. 3122, pp. 261–272. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27821-4_24
Buhrman, H., Koucký, M., Vereshchagin, N.: Randomised individual communication complexity. In: Proceedings of the 23rd CCC, pp. 321–331 (2008)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493–507 (1952)
Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001–1018 (1994)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comp Syst. Sci. 57(1), 37–49 (1998)
Newman, I.: Private vs. common random bits in communication complexity. Inf. Proc. Lett. 39(2), 67–71 (1991)
Nisan, N.: The communication complexity of threshold gates. Comb. Paul Erdos Eighty 1, 301–315 (1993)
Rao, A., Yehudayoff, A.: Communication Complexity (Early Draft) (2018). https://homes.cs.washington.edu/~anuprao/pubs/book.pdf
Sena, P., Venkatesh, S.: Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74, 364–385 (2008)
Smirnov, D.V.: Shannon’s information methods for lower bounds for probabilistic communication complexity. Master’s thesis, Moscow University (1988)
Starikovskaya, T.A.: Communication and streaming complexity of approximate pattern matching. In: Proceedings of the 28th CPM, pp. 13:1–13:11 (2017)
Starikovskaya, T.A.: Streaming and property testing algorithms for string processing. In: 26th London Stringology Days (2018)
Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: Proceedings of the 11th STOC, pp. 209–213 (1979)
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337–343 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Bille, P., Berggreen Ettienne, M., Grossi, R., Gørtz, I.L., Rotenberg, E. (2018). Compressed Communication Complexity of Longest Common Prefixes. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds) String Processing and Information Retrieval. SPIRE 2018. Lecture Notes in Computer Science(), vol 11147. Springer, Cham. https://doi.org/10.1007/978-3-030-00479-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-00479-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00478-1
Online ISBN: 978-3-030-00479-8
eBook Packages: Computer ScienceComputer Science (R0)