{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:28:15Z","timestamp":1771486095074,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486168","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Fast greedy algorithms in mapreduce and streaming"],"prefix":"10.1145","author":[{"given":"Ravi","family":"Kumar","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Vattani","sequence":"additional","affiliation":[{"name":"University of California, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687686"},{"key":"e_1_3_2_1_3_1","first-page":"434","volume-title":"SODA","author":"Babaioff M.","year":"2007"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"B. Bahmani R. Kumar and S. Vassilvitskii. Densest subgraph in streaming and MapReduce. PVLDB 5(1) 2012.   B. Bahmani R. Kumar and S. Vassilvitskii. Densest subgraph in streaming and MapReduce. PVLDB 5(1) 2012.","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886526"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80068-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989497"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1988776.1988781"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871501"},{"key":"e_1_3_2_1_15_1","first-page":"395","volume-title":"SODA","author":"Dean B. C.","year":"2005"},{"key":"e_1_3_2_1_16_1","volume-title":"OSDI, page 10","author":"Dean J.","year":"2004"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584082"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020515"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142380"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"A. Goyal F. Bonchi and L. V. S. Lakshmana. A data-based approach to social influence maximization. PVLDB 5(1) 2012.   A. Goyal F. Bonchi and L. V. S. Lakshmana. A data-based approach to social influence maximization. PVLDB 5(1) 2012.","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_3_2_1_24_1","first-page":"246","volume-title":"WINE","author":"Gupta A.","year":"2010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0205-6"},{"key":"e_1_3_2_1_26_1","first-page":"341","volume-title":"Proceedings of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing","author":"Jenkyns T. A.","year":"1976"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70322-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"A. Pietracaprina G. Pucci M. Riondato F. Silvestri and E. Upfal. Space-round tradeoffs for mapreduce computations. CoRR abs\/1111.2228 2011.  A. Pietracaprina G. Pucci M. Riondato F. Silvestri and E. Upfal. Space-round tradeoffs for mapreduce computations. CoRR abs\/1111.2228 2011.","DOI":"10.1145\/2304576.2304607"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767873"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_38_1","volume-title":"Charles University","author":"Vondrak J.","year":"2007"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":38,"alternative-id":["10.1145\/2486159.2486168","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486168","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}