{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T02:23:19Z","timestamp":1774318999256,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030549206","type":"print"},{"value":"9783030549213","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_16","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Testing of Distance-k Colorings"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Nolin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-662-53426-7_3","volume-title":"Distributed Computing","author":"A Abboud","year":"2016","unstructured":"Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 29\u201342. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_3"},{"issue":"1\u20132","key":"16_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0304-3975(96)00286-1","volume":"186","author":"Y Afek","year":"1997","unstructured":"Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci. 186(1\u20132), 199\u2013229 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR3","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: FOCS, pp. 268\u2013277 (1991)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bamberger, P., Kuhn, F., Maus, Y.: Efficient deterministic distributed coloring with small bandwidth. CoRR abs\/1912.02814 (2019)","DOI":"10.1145\/3382734.3404504"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702\u2013732 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00446-011-0132-x","volume":"24","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Patt-Shamir, B.: Distributed discovery of large near-cliques. Distrib. Comput. 24(2), 79\u201389 (2011). https:\/\/doi.org\/10.1007\/s00446-011-0132-x","journal-title":"Distrib. Comput."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Brody, J., Chakrabarti, A., Kondapally, R., Woodruff, D.P., Yaroslavtsev, G.: Beyond set disjointness: the communication complexity of finding the intersection. In: PODC, pp. 106\u2013113 (2014)","DOI":"10.1145\/2611462.2611501"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00446-018-0324-8","volume":"32","author":"K Censor-Hillel","year":"2018","unstructured":"Censor-Hillel, K., Fischer, E., Schwartzman, G., Vasudev, Y.: Fast distributed algorithms for testing graph properties. Distrib. Comput. 32(1), 41\u201357 (2018). https:\/\/doi.org\/10.1007\/s00446-018-0324-8","journal-title":"Distrib. Comput."},{"key":"16_CR9","unstructured":"Censor-Hillel, K., Khoury, S., Paz, A.: Quadratic and near-quadratic lower bounds for the CONGEST model. In: DISC, pp. 10:1\u201310:16 (2017)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: PODC, pp. 367\u2013376 (2014)","DOI":"10.1145\/2611462.2611493"},{"issue":"4","key":"16_CR11","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/110820774","volume":"41","author":"Y Emek","year":"2012","unstructured":"Emek, Y., Halld\u00f3rsson, M.M., Mansour, Y., Patt-Shamir, B., Radhakrishnan, J., Rawitz, D.: Online set packing. SIAM J. Comput. 41(4), 728\u2013746 (2012)","journal-title":"SIAM J. Comput."},{"key":"16_CR12","unstructured":"Even, G., et al.: Three notes on distributed property testing. In: DISC, pp. 15:1\u201315:30 (2017)"},{"key":"16_CR13","unstructured":"Feuilloley, L., Fraigniaud, P.: Survey of distributed decision. Bull. EATCS 119 (2016). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/411"},{"key":"16_CR14","unstructured":"Fischer, O., Gonen, T., Oshman, R.: Distributed property testing for subgraph-freeness revisited. CoRR abs\/1705.04033 (2017)"},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00446-014-0211-x","volume":"27","author":"P Fraigniaud","year":"2014","unstructured":"Fraigniaud, P., G\u00f6\u00f6s, M., Korman, A., Parter, M., Peleg, D.: Randomized distributed decision. Distrib. Comput. 27(6), 419\u2013434 (2014). https:\/\/doi.org\/10.1007\/s00446-014-0211-x","journal-title":"Distrib. Comput."},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1007\/s00453-015-9995-8","volume":"74","author":"P Fraigniaud","year":"2016","unstructured":"Fraigniaud, P., Halld\u00f3rsson, M.M., Patt-Shamir, B., Rawitz, D., Ros\u00e9n, A.: Shrinking maxima, decreasing costs: new online packing and covering problems. Algorithmica 74(4), 1205\u20131223 (2016). https:\/\/doi.org\/10.1007\/s00453-015-9995-8","journal-title":"Algorithmica"},{"issue":"5","key":"16_CR17","doi-asserted-by":"crossref","first-page":"35:1","DOI":"10.1145\/2499228","volume":"60","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM 60(5), 35:1\u201335:26 (2013)","journal-title":"J. ACM"},{"issue":"3","key":"16_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3322811","volume":"6","author":"P Fraigniaud","year":"2019","unstructured":"Fraigniaud, P., Olivetti, D.: Distributed detection of cycles. ACM Trans. Parallel Comput. 6(3), 1\u201320 (2019)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00446-018-0340-8","volume":"32","author":"P Fraigniaud","year":"2018","unstructured":"Fraigniaud, P., Patt-Shamir, B., Perry, M.: Randomized proof-labeling schemes. Distrib. Comput. 32(3), 217\u2013234 (2018). https:\/\/doi.org\/10.1007\/s00446-018-0340-8","journal-title":"Distrib. Comput."},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-662-53426-7_25","volume-title":"Distributed Computing","author":"P Fraigniaud","year":"2016","unstructured":"Fraigniaud, P., Rapaport, I., Salo, V., Todinca, I.: Distributed testing of excluded subgraphs. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 342\u2013356. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_25"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: SODA, pp. 1150\u20131162 (2012)","DOI":"10.1137\/1.9781611973099.91"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Harris, D.G., Kuhn, F.: On derandomizing local distributed algorithms. In: FOCS, pp. 662\u2013673 (2018)","DOI":"10.1109\/FOCS.2018.00069"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16367-8","volume-title":"Property Testing","year":"2010","unstructured":"Goldreich, O. (ed.): Property Testing. LNCS, vol. 6390. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16367-8"},{"issue":"1","key":"16_CR24","first-page":"1","volume":"12","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Suomela, J.: Locally checkable proofs in distributed computing. Theory Comput. 12(1), 1\u201333 (2016)","journal-title":"Theory Comput."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Kuhn, F., Maus, Y.: Distance-2 coloring in the CONGEST model. CoRR abs\/2005.06528 (2020)","DOI":"10.1145\/3382734.3405706"},{"issue":"11","key":"16_CR26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.4086\/toc.2007.v003a011","volume":"3","author":"J H\u00e5stad","year":"2007","unstructured":"H\u00e5stad, J., Wigderson, A.: The randomized communication complexity of set disjointness. Theory Comput. 3(11), 211\u2013219 (2007)","journal-title":"Theory Comput."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: PODC, pp. 355\u2013364 (2012)","DOI":"10.1145\/2332432.2332504"},{"key":"16_CR28","unstructured":"Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: FOCS, pp. 226\u2013239 (1994)"},{"issue":"4","key":"16_CR29","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Math. 5(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Kol, G., Oshman, R., Saxena, R.R.: Interactive distributed proofs. In: PODC, pp. 255\u2013264 (2018)","DOI":"10.1145\/3212734.3212771"},{"issue":"4","key":"16_CR31","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-24100-0_40","volume-title":"Distributed Computing","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: The complexity of data aggregation in directed networks. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 416\u2013431. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_40"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: SODA, pp. 1096\u20131115 (2020)","DOI":"10.1137\/1.9781611975994.67"},{"key":"16_CR34","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BFb0032036","volume":"106","author":"AA Razborov","year":"1992","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. Theory Comput. Sci. 106, 385\u2013390 (1992). https:\/\/doi.org\/10.1007\/BFb0032036","journal-title":"Theory Comput. Sci."},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Rozho\u0148, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. CoRR abs\/1907.10937 (2019)","DOI":"10.1145\/3357713.3384298"},{"issue":"5","key":"16_CR36","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/11085178X","volume":"41","author":"AD Sarma","year":"2012","unstructured":"Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235\u20131265 (2012)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T17:37:34Z","timestamp":1619199454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}