{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:09Z","timestamp":1763468169314},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_2","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"16-30","source":"Crossref","is-referenced-by-count":26,"title":["When Distributed Computation Is Communication Expensive"],"prefix":"10.1007","author":[{"given":"David P.","family":"Woodruff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","first-page":"459","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kook Jin Ahn","year":"2012","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)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proc. ACM Symposium on Principles of Database Systems, pp. 5\u201314 (2012)","DOI":"10.1145\/2213556.2213560"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-02927-1_10","volume-title":"Automata, Languages and Programming","author":"C. Arackaparambil","year":"2009","unstructured":"Arackaparambil, C., Brody, J., Chakrabarti, A.: Functional monitoring without monotonicity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"2_CR4","unstructured":"Balcan, M.-F., Blum, A., Fine, S., Mansour, Y.: Distributed learning, communication complexity and privacy. Journal of Machine Learning Research - Proceedings Track\u00a023, 26.1\u201326.22 (2012)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. In: PODS, pp. 273\u2013284 (2013)","DOI":"10.1145\/2463664.2465224"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11499923_9","volume-title":"Data Management in a Connected World","author":"P. Brown","year":"2005","unstructured":"Brown, P., Haas, P.J., Myllymaki, J., Pirahesh, H., Reinwald, B., Sismanis, Y.: Toward automated large-scale information integration and discovery. In: H\u00e4rder, T., Lehner, W. (eds.) Data Management (Wedekind Festschrift). LNCS, vol.\u00a03551, pp. 161\u2013180. Springer, Heidelberg (2005)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","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 Transactions on Algorithms\u00a07(2), 21 (2011)","journal-title":"ACM Transactions on Algorithms"},{"key":"2_CR8","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs, pp. 17\u201361. Publication of the Mathematical Institute of the Hungarian Academy of Sciences (1960)"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TNET.2006.882836","volume":"14","author":"C. Estan","year":"2006","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high-speed links. IEEE\/ACM Trans. Netw.\u00a014(5), 925\u2013937 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2_CR10","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\u00a0(1) (2008)","DOI":"10.46298\/dmtcs.3545"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a031(2), 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","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. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25591-5_39","volume-title":"Algorithms and Computation","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the mapReduce framework. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 374\u2013383. Springer, Heidelberg (2011)"},{"key":"2_CR14","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":"2_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z., Yi, K., Zhang, Q.: Randomized algorithms for tracking distributed count, frequencies, and ranks. In: Proc. ACM Symposium on Principles of Database Systems, pp. 295\u2013306 (2012)","DOI":"10.1145\/2213556.2213596"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-34106-9_15","volume-title":"Algorithmic Learning Theory","author":"H. Daum\u00e9 III","year":"2012","unstructured":"Daum\u00e9 III, H., Phillips, J.M., Saha, A., Venkatasubramanian, S.: Efficient protocols for distributed classification and optimization. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS, vol.\u00a07568, pp. 154\u2013168. Springer, Heidelberg (2012)"},{"key":"2_CR17","first-page":"282","volume":"22","author":"H. Daum\u00e9 III","year":"2012","unstructured":"Daum\u00e9 III, H., Phillips, J.M., Saha, A., Venkatasubramanian, S.: Protocols for learning classifiers on distributed data. Journal of Machine Learning Research - Proceedings Track\u00a022, 282\u2013290 (2012)","journal-title":"Journal of Machine Learning Research - Proceedings Track"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proc. ACM Symposium on Principles of Database Systems, pp. 41\u201352 (2010)","DOI":"10.1145\/1807085.1807094"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1137\/1.9781611973075.76","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Howard Karloff","year":"2010","unstructured":"Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948 (2010)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Koutris, P., Suciu, D.: Parallel evaluation of conjunctive queries. In: Proc. ACM Symposium on Principles of Database Systems, pp. 223\u2013234 (2011)","DOI":"10.1145\/1989284.1989310"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574948"},{"key":"2_CR22","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: Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 81\u201390 (2002)","DOI":"10.1145\/775047.775059"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Phillips, J.M., Verbin, E., Zhang, Q.: Lower bounds for number-in-hand multiparty communication complexity, made easy. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (2012)","DOI":"10.1137\/1.9781611973099.42"},{"key":"2_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0032036","volume-title":"Proc. International Colloquium on Automata, Languages, and Programming","author":"A.A. Razborov","year":"1990","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. In: Paterson, M.S. (ed.) Proc. International Colloquium on Automata, Languages, and Programming. LNCS, vol.\u00a0443, pp. 249\u2013253. Springer, Heidelberg (1990)"},{"issue":"8","key":"2_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM\u00a033(8), 103\u2013111 (1990)","journal-title":"Communications of the ACM"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: Tight bounds for distributed functional monitoring. In: Proc. ACM Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2214063"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Zhang, Q.: When distributed computation is communication expensive. CoRR, abs\/1304.4636 (2013)","DOI":"10.1007\/978-3-642-41527-2_2"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. IEEE Symposium on Foundations of Computer Science (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T16:03:46Z","timestamp":1646669026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}