{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:07Z","timestamp":1759638847219,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755596","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"340-349","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Randomized Local Network Computing"],"prefix":"10.1145","author":[{"given":"Laurent","family":"Feuilloley","sequence":"first","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.37"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670418.2670440"},{"key":"e_1_3_2_1_3_1","volume-title":"Mathieu: Distributedly Testing Cycle-Freeness. In proc. 40th Int. Work. on Graph-Theoretic Concepts in Computer Science (WG)","author":"Arfaoui H.","year":"2014","unstructured":"H. Arfaoui , P. Fraigniaud , D. Ilcinkas , F. Mathieu: Distributedly Testing Cycle-Freeness. In proc. 40th Int. Work. on Graph-Theoretic Concepts in Computer Science (WG) , Springer LNCS , pp15--28, 2014 . H. Arfaoui, P. Fraigniaud, D. Ilcinkas, F. Mathieu: Distributedly Testing Cycle-Freeness. In proc. 40th Int. Work. on Graph-Theoretic Concepts in Computer Science (WG), Springer LNCS, pp15--28, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02009-4","volume-title":"Elkin: Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory","author":"Barenboim L.","year":"2013","unstructured":"L. Barenboim , M. Elkin: Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory , Morgan & Claypool Publishers , 2013 . L. Barenboim, M. Elkin: Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_20"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611465"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281114"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611478"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584058"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0211-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484264"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499228"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0188-x"},{"key":"e_1_3_2_1_15_1","first-page":"92","volume-title":"C. Travers: On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. In proc. 5th International Conference on Runtime Verification (RV)","author":"Fraigniaud P.","year":"2014","unstructured":"P. Fraigniaud , S. Rajsbaum , C. Travers: On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. In proc. 5th International Conference on Runtime Verification (RV) , pp 92 -- 107 , 2014 . P. Fraigniaud, S. Rajsbaum, C. Travers: On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. In proc. 5th International Conference on Runtime Verification (RV), pp92--107, 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813197"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528405"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31104-8_5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281113"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"A. Korman J.-S. Sereni L. Viennot: Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Computing 26(5--6): 289--308 (2013)  A. Korman J.-S. Sereni L. Viennot: Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Computing 26(5--6): 289--308 (2013)","DOI":"10.1007\/s00446-012-0174-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378540"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_27"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073977"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404036"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431223"}],"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.2755596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755596","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.2755596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":30,"alternative-id":["10.1145\/2755573.2755596","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755596","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"}}]}}