{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:56Z","timestamp":1763468036937,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993686","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"363-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":70,"title":["Distributed verification and hardness of distributed approximation"],"prefix":"10.1145","author":[{"given":"Atish","family":"Das Sarma","sequence":"first","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}]},{"given":"Stephan","family":"Holzer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Liah","family":"Kor","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[{"name":"CNRS & LIAFA, Univ. Paris 7, Paris, France"}]},{"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[{"name":"University of Vienna & Georgia Institute of Technology, Vienna, Austria"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"Nanyang Technological University & Brown University, Singapore, Singapore"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.15"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1855118.1855133"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_2_5_1","volume-title":"Distributed verification and hardness of distributed approximation. CoRR, abs\/1011.3049","author":"Sarma A. Das","year":"2010","unstructured":"A. Das Sarma , S. Holzer , L. Kor , A. Korman , D. Nanongkai , G. Pandurangan , D. Peleg , and R. Wattenhofer . Distributed verification and hardness of distributed approximation. CoRR, abs\/1011.3049 , 2010 . A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. CoRR, abs\/1011.3049, 2010."},{"key":"e_1_3_2_2_6_1","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"Dubhashi D. P.","year":"2007","unstructured":"D. P. Dubhashi , F. Grandioni , and A. Panconesi . Distributed Algorithms via LP Duality and Randomization . In Handbook of Approximation Algorithms and Metaheuristics . Chapman and Hall\/CRC , 2007 . D. P. Dubhashi, F. Grandioni, and A. Panconesi. Distributed Algorithms via LP Duality and Randomization. In Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall\/CRC, 2007."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054916.1054931"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103968"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.07.002"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1090\/dimacs\/050\/05","volume-title":"External memory algorithms","author":"Henzinger M. R.","year":"1999","unstructured":"M. R. Henzinger , P. Raghavan , and S. Rajagopalan . Computing on data streams . In J. M. Abello and J. S. Vitter, editors, External memory algorithms , pages 107 -- 118 . American Mathematical Society , Boston, MA, USA , 1999 . M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In J. M. Abello and J. S. Vitter, editors, External memory algorithms, pages 107--118. American Mathematical Society, Boston, MA, USA, 1999."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400787"},{"key":"e_1_3_2_2_15_1","volume-title":"STACS","author":"Kor L.","year":"2011","unstructured":"L. Kor , A. Korman , and D. Peleg . Tight bounds for distributed MST verification . STACS , 2011 . L. Kor, A. Korman, and D. Peleg. Tight bounds for distributed MST verification. STACS, 2011."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146389"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383984"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_2_23_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N.","year":"1996","unstructured":"N. Lynch . Distributed Algorithms. Morgan Kaufmann , 1996 . N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"e_1_3_2_2_28_1","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation Algorithms . Springer , July 2001 . V. V. Vazirani. Approximation Algorithms. Springer, July 2001."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732253X"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:10Z","timestamp":1750244770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":30,"alternative-id":["10.1145\/1993636.1993686","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993686","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}