{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:55:16Z","timestamp":1778586916310,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T00:00:00Z","timestamp":1401840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00446-014-0221-8","type":"journal-article","created":{"date-parts":[[2014,6,3]],"date-time":"2014-06-03T12:55:50Z","timestamp":1401800150000},"page":"189-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Allowing each node to communicate only once in a distributed system: shared whiteboard models"],"prefix":"10.1007","volume":"28","author":[{"given":"Florent","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Matamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Rapaport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"Suchan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,4]]},"reference":[{"key":"221_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM J. Comput. 33, 137\u2013166 (2004)","DOI":"10.1137\/S0097539700375944"},{"key":"221_CR2","doi-asserted-by":"crossref","unstructured":"Becker, F., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., Todinca, I.: Adding a referee to an interconnection network: What can(not) be computed in one round. In: Parallel and Distributed Processing Symposium, International, pp. 508\u2013514. IEEE Computer Society (2011)","DOI":"10.1109\/IPDPS.2011.55"},{"key":"221_CR3","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC \u201983, pp. 94\u201399. ACM (1983)","DOI":"10.1145\/800061.808737"},{"key":"221_CR4","doi-asserted-by":"crossref","first-page":"66:1","DOI":"10.1145\/1824777.1824786","volume":"6","author":"J Feldman","year":"2010","unstructured":"Feldman, J., Muthukrishnan, S.M., Sidiropoulos, A., Stein, C., Svitkina, Z.: On distributing symmetric streaming computations. ACM Trans. Algorithms 6, 66:1\u201366:19 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"221_CR5","doi-asserted-by":"crossref","first-page":"35","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 (2013)","journal-title":"J. ACM"},{"key":"221_CR6","unstructured":"Grumbach, S., Wu, Z.: Logical locality entails frugal distributed computation over graphs. In: Proceedings of 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, 5911, pp. 154\u2013165 (2009)"},{"key":"221_CR7","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307\u2013316 (1984)","DOI":"10.1007\/BF02579141"},{"key":"221_CR8","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309. ACM (2004)","DOI":"10.1145\/1011767.1011811"},{"issue":"1","key":"221_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"221_CR10","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259\u20131277 (1995)","journal-title":"SIAM J. Comput."},{"key":"221_CR11","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"221_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95, 261\u2013265 (1984)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"2","key":"221_CR13","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A Thomason","year":"2001","unstructured":"Thomason, A.: The extremal function for complete minors. J. Comb. Theory. Ser. B 81(2), 318\u2013338 (2001)","journal-title":"J. Comb. Theory. Ser. B"},{"key":"221_CR14","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1090\/S0002-9904-1948-09071-1","volume":"8","author":"E Wright","year":"1948","unstructured":"Wright, E.: Equal sums of like powers. Bull. Amer. Math. Soc. 8, 755\u2013757 (1948)","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0221-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0221-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0221-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:45Z","timestamp":1559122005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0221-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,4]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0221-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,4]]}}}