{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:19:15Z","timestamp":1758266355151,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527867, CCF-1540512, IIS-1633720, and CCF-1717075"],"award-info":[{"award-number":["CCF-1527867, CCF-1540512, IIS-1633720, and CCF-1717075"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210409","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"405-414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["On the Distributed Complexity of Large-Scale Graph Computations"],"prefix":"10.1145","author":[{"given":"Gopal","family":"Pandurangan","sequence":"first","affiliation":[{"name":"University of Houston, Houston, TX, USA"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"McMaster University, Hamilton, ON, Canada"}]},{"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Giraph http:\/\/giraph.apache.org\/.  Giraph http:\/\/giraph.apache.org\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.47"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154317"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767414"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26784-5_14"},{"key":"e_1_3_2_1_8_1","volume-title":"Elements of Information Theory","author":"Cover T. M.","year":"2006","unstructured":"T. M. Cover and J. A. Thomas . Elements of Information Theory . Wiley , 2006 . T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.04.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611488"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933103"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087811"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175472"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722157"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441848"},{"key":"e_1_3_2_1_22_1","volume-title":"Morgan Kaufmann Publishers Inc","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers Inc ., 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993853"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09620-9_2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48314-6_6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935785"},{"key":"e_1_3_2_1_28_1","volume-title":"Tight bounds for distributed graph computations. CoRR, abs\/1602.08481","author":"Pandurangan G.","year":"2016","unstructured":"G. Pandurangan , P. Robinson , and M. Scquizzato . Tight bounds for distributed graph computations. CoRR, abs\/1602.08481 , 2016 . G. Pandurangan, P. Robinson, and M. Scquizzato. Tight bounds for distributed graph computations. CoRR, abs\/1602.08481, 2016."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209689"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_32_1","volume-title":"Towards HPC-ABDS: An initial high-performance big data stack, in building robust big data ecosystem","author":"Qiu J.","year":"2014","unstructured":"J. Qiu , S. Jha , A. Luckow , and G. C. Fox . Towards HPC-ABDS: An initial high-performance big data stack, in building robust big data ecosystem . 2014 . J. Qiu, S. Jha, A. Luckow, and G. C. Fox. Towards HPC-ABDS: An initial high-performance big data stack, in building robust big data ecosystem. 2014."},{"key":"e_1_3_2_1_33_1","volume-title":"An introduction to information theory","author":"Reza F. M.","year":"1961","unstructured":"F. M. Reza . An introduction to information theory . Courier Corporation , 1961 . F. M. Reza. An introduction to information theory. Courier Corporation, 1961."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050202"},{"key":"e_1_3_2_1_35_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0052928","volume-title":"Universal Routing Strategies for Interconnection Networks","author":"Scheideler C.","year":"1998","unstructured":"C. Scheideler . Universal Routing Strategies for Interconnection Networks , volume 1390 of Lecture Notes in Computer Science . Springer , 1998 . C. Scheideler. Universal Routing Strategies for Interconnection Networks, volume 1390 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"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","unstructured":"S. Vassilvitskii. Models for parallel computation (a hitchhikers' guide to massively parallel universes) http:\/\/grigory.us\/blog\/massively-parallel-universes\/ 2015.  S. Vassilvitskii. Models for parallel computation (a hitchhikers' guide to massively parallel universes) http:\/\/grigory.us\/blog\/massively-parallel-universes\/ 2015."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0218-3"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210409","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":39,"alternative-id":["10.1145\/3210377.3210409","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210409","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}