{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:47Z","timestamp":1763468087264,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2304576.2304607","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Space-round tradeoffs for MapReduce computations"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Pietracaprina","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Padova, Padova, Italy"}]},{"given":"Geppino","family":"Pucci","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Padova, Padova, Italy"}]},{"given":"Matteo","family":"Riondato","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Francesco","family":"Silvestri","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Padova, Padova, Italy"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-642-15369-3_31","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Amossen R.","year":"2010","unstructured":"R. Amossen , A. Campagna , and R. Pagh . Better size estimation for sparse matrix products . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , volume 6302 of Lecture Notes in Computer Science , pages 406 -- 419 , 2010 . R. Amossen, A. Campagna, and R. Pagh. Better size estimation for sparse matrix products. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 6302 of Lecture Notes in Computer Science, pages 406--419, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_3_1","first-page":"1150","volume-title":"Encyclopedia of Parallel Computing","author":"Bilardi G.","year":"2011","unstructured":"G. Bilardi and A. Pietracaprina . Theoretical models of computation . In D. Padua, editor, Encyclopedia of Parallel Computing , pages 1150 -- 1158 . Springer , 2011 . G. Bilardi and A. Pietracaprina. Theoretical models of computation. In D. Padua, editor, Encyclopedia of Parallel Computing, pages 1150--1158. Springer, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.45"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824786"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2008.45"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294141"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12200-2_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_15_1","volume-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1 J.","year":"1992","unstructured":"J. J\u00e1J\u00e1 . An Introduction to Parallel Algorithms . Addison Wesley Longman Publishing Co., Inc. , 1992 . J. J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc., 1992."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90058-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855013"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1050"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008264"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1155\/1999\/32697"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","year":"2005","unstructured":"M. Mitzenmacher and E. Upfal . Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press , Cambridge MA , 2005 . M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge MA, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579206"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22161"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.008"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_30_1","first-page":"254","volume-title":"Proc. of 15th ACM-SIAM Symp. On Discrete Algorithms","author":"Yuster R.","year":"2004","unstructured":"R. Yuster and U. Zwick . Detecting short directed cycles using rectangular matrix multiplication and dynamic programming . In Proc. of 15th ACM-SIAM Symp. On Discrete Algorithms , pages 254 -- 260 , 2004 . R. Yuster and U. Zwick. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In Proc. of 15th ACM-SIAM Symp. On Discrete Algorithms, pages 254--260, 2004."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"}],"event":{"name":"ICS'12: International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"San Servolo Island, Venice Italy","acronym":"ICS'12"},"container-title":["Proceedings of the 26th ACM international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2304576.2304607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2304576.2304607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:47Z","timestamp":1750236527000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2304576.2304607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":30,"alternative-id":["10.1145\/2304576.2304607","10.1145\/2304576"],"URL":"https:\/\/doi.org\/10.1145\/2304576.2304607","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}