{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:52Z","timestamp":1750306612546,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["246\/08, 1536\/14"],"award-info":[{"award-number":["246\/08, 1536\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217423, CCF-1065125, CCF-1420692"],"award-info":[{"award-number":["CCF-1217423, CCF-1065125, CCF-1420692"]}],"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":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755615","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"59-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Local Computation Algorithms for Graphs of Non-Constant Degrees"],"prefix":"10.1145","author":[{"given":"Reut","family":"Levi","sequence":"first","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure and Universit\u00e9 Paris Diderot, Paris, France"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[{"name":"CSAIL, MIT, Cambridge, MA, USA"}]},{"given":"Anak","family":"Yodpinyanee","sequence":"additional","affiliation":[{"name":"CSAIL, MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095205"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.60"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_33"},{"key":"e_1_3_2_1_6_1","volume-title":"Distributed maximum matching in bounded degree graphs. arXiv preprint arXiv:1407.7882","author":"Even G.","year":"2014","unstructured":"G. Even , M. Medina , and D. Ron . Distributed maximum matching in bounded degree graphs. arXiv preprint arXiv:1407.7882 , 2014 . G. Even, M. Medina, and D. Ron. Distributed maximum matching in bounded degree graphs. arXiv preprint arXiv:1407.7882, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_19"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.81"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095204"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.040"},{"key":"e_1_3_2_1_13_1","volume-title":"New techniques and tighter bounds for local computation algorithms. arXiv preprint arXiv:1404.5398","author":"Reingold O.","year":"2014","unstructured":"O. Reingold and S. Vardi . New techniques and tighter bounds for local computation algorithms. arXiv preprint arXiv:1404.5398 , 2014 . O. Reingold and S. Vardi. New techniques and tighter bounds for local computation algorithms. arXiv preprint arXiv:1404.5398, 2014."},{"key":"e_1_3_2_1_14_1","first-page":"223","volume-title":"Proceedings","author":"Rubinfeld R.","year":"2011","unstructured":"R. Rubinfeld , G. Tamir , S. Vardi , and N. Xie . Fast local computation algorithms. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 7--9, 2011 . Proceedings , pages 223 -- 238 , 2011 . R. Rubinfeld, G. Tamir, S. Vardi, and N. Xie. Fast local computation algorithms. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 7--9, 2011. Proceedings, pages 223--238, 2011."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/110828691"}],"event":{"name":"SPAA '15: 27th 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"],"location":"Portland Oregon USA","acronym":"SPAA '15"},"container-title":["Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:05Z","timestamp":1750227425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":15,"alternative-id":["10.1145\/2755573.2755615","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755615","relation":{},"subject":[],"published":{"date-parts":[[2015,6,13]]},"assertion":[{"value":"2015-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}