{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T13:47:51Z","timestamp":1790689671324,"version":"4.1.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T00:00:00Z","timestamp":1399248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00446-014-0218-3","type":"journal-article","created":{"date-parts":[[2014,5,4]],"date-time":"2014-05-04T07:59:09Z","timestamp":1399190349000},"page":"309-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["When distributed computation is communication expensive"],"prefix":"10.1007","volume":"30","author":[{"given":"David P.","family":"Woodruff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,5]]},"reference":[{"key":"218_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 459\u2013467. SIAM (2012)","DOI":"10.1137\/1.9781611973099.40"},{"key":"218_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: Sparsification, spanners, and subgraphs. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 5\u201314 (2012)","DOI":"10.1145\/2213556.2213560"},{"key":"218_CR3","doi-asserted-by":"crossref","unstructured":"Arackaparambil, C., Brody, J., Chakrabarti, A.: Functional monitoring without monotonicity. In: Proceedings of International Colloquium on Automata, Languages, and Programming (2009)","DOI":"10.1007\/978-3-642-02927-1_10"},{"key":"218_CR4","unstructured":"Balcan, M.-F., Blum, A., Fine, S., Mansour, Y.: Distributed learning, communication complexity and privacy. J. Mach. Learn. Res. Proc. Track, 23, 26.1\u201326.22 (2012)"},{"key":"218_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 273\u2013284 (2013)","DOI":"10.1145\/2463664.2465224"},{"key":"218_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Ellen, F., Oshman, R., Pitassi, T., Vaikuntanathan, V.: A tight bound for set disjointness in the message-passing model. In: FOCS, pp. 668\u2013677 (2013)","DOI":"10.1109\/FOCS.2013.77"},{"key":"218_CR7","doi-asserted-by":"crossref","unstructured":"Brown, P., Haas, P.J., Myllymaki, J., Pirahesh, H., Reinwald, B., Sismanis, Y.: Toward automated large-scale information integration and discovery, pp. 161\u2013180. In: Data Management in a Connected, World (2005)","DOI":"10.1007\/11499923_9"},{"issue":"2","key":"218_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/1921659.1921667","volume":"7","author":"G Cormode","year":"2011","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. ACM Trans. Algorithms 7(2), 21 (2011)","journal-title":"ACM Trans . Algorithms"},{"key":"218_CR9","doi-asserted-by":"crossref","unstructured":"Daum\u00e9, III, H.D., Phillips, J.M., Saha, A., Venkatasubramanian, S.: Efficient protocols for distributed classification and optimization. In: Algorithmic Learning Theory, pp. 154\u2013168 (2012)","DOI":"10.1007\/978-3-642-34106-9_15"},{"key":"218_CR10","unstructured":"Daum\u00e9, III, H.D., Phillips, J.M., Saha, A., Venkatasubramanian, S.: Protocols for learning classifiers on distributed data. J. Mach. Learn. Res. Proc. Track 22, 282\u2013290 (2012)"},{"issue":"5","key":"218_CR11","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740\u20131759 (2000)","journal-title":"SIAM J. Comput."},{"key":"218_CR12","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the mathematical institute of the hungarian academy of sciences, pp. 17\u201361 (1960)"},{"key":"218_CR13","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high-speed links. IEEE\/ACM Trans. Netw. 14(5), 925\u2013937 (Oct. 2006)","DOI":"10.1109\/TNET.2006.882836"},{"key":"218_CR14","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. DMTCS Proceedings (1) (2008)","DOI":"10.46298\/dmtcs.3545"},{"issue":"2","key":"218_CR15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"218_CR16","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"218_CR17","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the mapreduce framework. In: Proceedings of International Symposium on Algorithms and Computation, pp. 374\u2013383 (2011)","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"218_CR18","unstructured":"Huang, Z., Radunovi\u0107, B., Vojnovi\u0107, M., Zhang, Q.: The communication complexity of approximate maximum matching in distributed data. Manuscript (2013). http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=188946"},{"key":"218_CR19","doi-asserted-by":"crossref","unstructured":"Huang, Z., Yi, K., Zhang, Q.: Randomized algorithms for tracking distributed count, frequencies, and ranks. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 295\u2013306 (2012)","DOI":"10.1145\/2213556.2213596"},{"key":"218_CR20","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 41\u201352 (2010)","DOI":"10.1145\/1807085.1807094"},{"key":"218_CR21","doi-asserted-by":"crossref","unstructured":"Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948 (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"218_CR22","doi-asserted-by":"crossref","unstructured":"Koutris, P., Suciu, D.: Parallel evaluation of conjunctive queries. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 223\u2013234 (2011)","DOI":"10.1145\/1989284.1989310"},{"key":"218_CR23","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"218_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"218_CR25","doi-asserted-by":"crossref","unstructured":"Palmer, C.R., Gibbons, P.B., Faloutsos, C.: Anf: a fast and scalable tool for data mining in massive graphs. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 81\u201390 (2002)","DOI":"10.1145\/775047.775059"},{"key":"218_CR26","doi-asserted-by":"crossref","unstructured":"Phillips, J.M., Verbin, E., Zhang, Q.: Lower bounds for number-in-hand multiparty communication complexity, made easy. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (2012)","DOI":"10.1137\/1.9781611973099.42"},{"key":"218_CR27","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. In: Proceedings of International Colloquium on Automata, Languages, and Programming (1990)","DOI":"10.1007\/BFb0032036"},{"issue":"8","key":"218_CR28","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"218_CR29","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: An optimal lower bound for distinct elements in the message passing model. In SODA, pp. 718\u2013733 (2014)","DOI":"10.1137\/1.9781611973402.54"},{"key":"218_CR30","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: Tight bounds for distributed functional monitoring. In: Proceedings of ACM Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2214063"},{"key":"218_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: Towards a unified measure of complexity. In: Proceedings of IEEE Symposium on Foundations of Computer Science (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0218-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0218-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0218-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0218-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:00:01Z","timestamp":1648926001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0218-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,5]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0218-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,5]]}}}