{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T12:28:06Z","timestamp":1790512086397,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["336495"],"award-info":[{"award-number":["336495"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055471","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T16:27:45Z","timestamp":1497544065000},"page":"784-797","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":80,"title":["On the complexity of local distributed graph problems"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannic","family":"Maus","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"N. Alon L. Babai and A. Itai. 1986.  N. Alon L. Babai and A. Itai. 1986."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms (SODA). 1132\u2013 1139","author":"Alon N."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_2_5_1","unstructured":"B. Awerbuch B. Berger L. Cowen and D. Peleg. 1996.  B. Awerbuch B. Berger L. Cowen and D. Peleg. 1996."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0159"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63504"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89571"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_37"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767410"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835797"},{"key":"e_1_3_2_2_12_1","unstructured":"L. Barenboim and M. Elkin. 2013.  L. Barenboim and M. Elkin. 2013."},{"key":"e_1_3_2_2_13_1","unstructured":"Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers.   Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_15"},{"key":"e_1_3_2_2_15_1","unstructured":"L. Barenboim M. Elkin and F. Kuhn. 2015.  L. Barenboim M. Elkin and F. Kuhn. 2015."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Distributed (\u2206 + 1)-Coloring in Linear (in \u2206) Time. SIAM J. Computing 43 1 (2015) 72\u201395.  Distributed (\u2206 + 1)-Coloring in Linear (in \u2206) Time. SIAM J. Computing 43 1 (2015) 72\u201395.","DOI":"10.1137\/12088848X"},{"key":"e_1_3_2_2_17_1","unstructured":"L. Barenboim M. Elkin S. Pettie and J. Schneider. 2012.  L. Barenboim M. Elkin S. Pettie and J. Schneider. 2012."},{"key":"e_1_3_2_2_18_1","volume-title":"Locality of Distributed Symmetry Breaking. In Proc. 53th Symp. on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS). 303\u2013312","author":"Bartal Y."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9444-5"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933068"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897570"},{"key":"e_1_3_2_2_23_1","unstructured":"Y.-J. Chang T. Kopelowitz and S. Pettie. 2016.  Y.-J. Chang T. Kopelowitz and S. Pettie. 2016."},{"key":"e_1_3_2_2_24_1","unstructured":"An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR abs\/1602.08166 (2016).  An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR abs\/1602.08166 (2016)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.10.004"},{"key":"e_1_3_2_2_27_1","unstructured":"D. Dubhashi A. Mei A. Panconesia J. Radhakrishnan and A. Srinivasan. 2005.  D. Dubhashi A. Mei A. Panconesia J. Radhakrishnan and A. Srinivasan. 2005."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.04.002"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933094"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702431840"},{"key":"e_1_3_2_2_31_1","volume-title":"Proc. 43rd Coll. on Automata, Languages, and Programming (ICALP). 118:1\u2013 118:15","author":"Feuilloley L."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484264"},{"key":"e_1_3_2_2_33_1","volume-title":"Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS).","author":"Fraigniaud P."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_3"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0211-x"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499228"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884455"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039852"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401044"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0194-z"},{"key":"e_1_3_2_2_41_1","unstructured":"M. Ha\u0144\u0107kowiak M. Karo\u0144ski and A. Panconesi. 2001.  M. Ha\u0144\u0107kowiak M. Karo\u0144ski and A. Panconesi. 2001."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/587903.587968"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897533"},{"key":"e_1_3_2_2_44_1","volume-title":"Proc. 30th Symp. on Distributed Computing (DISC). 99\u2013113","author":"Hefetz D."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"L. Jia R. Rajaraman and R. Suel. 2002.  L. Jia R. Rajaraman and R. Suel. 2002.","DOI":"10.1088\/1126-6708\/2002\/10\/009"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/777474.777476"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584032"},{"key":"e_1_3_2_2_48_1","unstructured":"F. Kuhn T. Moscibroda and R. Wattenhofer. 2006.  F. Kuhn T. Moscibroda and R. Wattenhofer. 2006."},{"key":"e_1_3_2_2_49_1","volume-title":"Price of Being Near-Sighted. In Proc. 17th Symp. on Discrete Algorithms (SODA). 980\u2013989"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01303516"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0017"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167127"},{"key":"e_1_3_2_2_57_1","unstructured":"D. Peleg. 2000.  D. Peleg. 2000."},{"key":"e_1_3_2_2_58_1","unstructured":"Distributed Computing: A Locality-Sensitive Approach. SIAM.  Distributed Computing: A Locality-Sensitive Approach. SIAM."},{"key":"e_1_3_2_2_59_1","unstructured":"R. Rubinfeld G. Tamir S. Vardi and N. Xie. 2011.  R. Rubinfeld G. Tamir S. Vardi and N. Xie. 2011."},{"key":"e_1_3_2_2_60_1","volume-title":"Local Computation Algorithms. In Proc. 2nd Symp. on Innovations in Computer Science (ICS). 223\u2013 238"},{"key":"e_1_3_2_2_61_1","volume-title":"Geometry\u2013 Intuitive, Discrete, and Convex","author":"Smorodinsky S."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431223"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:19Z","timestamp":1750203379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":62,"alternative-id":["10.1145\/3055399.3055471","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055471","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}