{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:21:39Z","timestamp":1773314499904,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00446-013-0202-3","type":"journal-article","created":{"date-parts":[[2013,12,31]],"date-time":"2013-12-31T10:26:31Z","timestamp":1388485591000},"page":"31-53","source":"Crossref","is-referenced-by-count":30,"title":["Weak models of distributed computing, with connections to modal logic"],"prefix":"10.1007","volume":"28","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[]},{"given":"Antti","family":"Kuusisto","sequence":"additional","affiliation":[]},{"given":"Juhana","family":"Laurinharju","sequence":"additional","affiliation":[]},{"given":"Tuomo","family":"Lempi\u00e4inen","sequence":"additional","affiliation":[]},{"given":"Kerkko","family":"Luosto","sequence":"additional","affiliation":[]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[]},{"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,1]]},"reference":[{"key":"202_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. In: Proceedings of 25th International Symposium on Distributed Computing (DISC 2011), Lecture Notes in Computer Science, vol. 6950, pp. 32\u201350. Springer (2011). doi: 10.1007\/978-3-642-24100-0_3","DOI":"10.1007\/978-3-642-24100-0_3"},{"key":"202_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82\u201393. ACM Press (1980). doi: 10.1145\/800141.804655","DOI":"10.1145\/800141.804655"},{"key":"202_CR3","doi-asserted-by":"crossref","unstructured":"\u00c5strand, M., Flor\u00e9en, P., Polishchuk, V., Rybicki, J., Suomela, J., Uitto, J.: A local 2-approximation algorithm for the vertex cover problem. In: Proceedings of 23rd International Symposium on Distributed Computing (DISC 2009), Lecture Notes in Computer Science, vol. 5805, pp. 191\u2013205. Springer (2009). doi: 10.1007\/978-3-642-04355-0_21","DOI":"10.1007\/978-3-642-04355-0_21"},{"key":"202_CR4","unstructured":"\u00c5strand, M., Polishchuk, V., Rybicki, J., Suomela, J., Uitto, J.: Local algorithms in (weakly) coloured graphs (2010). arXiv:1002.0125"},{"key":"202_CR5","doi-asserted-by":"crossref","unstructured":"\u00c5strand, M., Suomela, J.: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In: Proceedings of 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 294\u2013302. ACM Press (2010). doi: 10.1145\/1810479.1810533","DOI":"10.1145\/1810479.1810533"},{"issue":"4","key":"202_CR6","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.K.: Computing on an anonymous ring. J. ACM 35(4), 845\u2013875 (1988). doi: 10.1145\/48014.48247","journal-title":"J. ACM"},{"key":"202_CR7","unstructured":"Benthem, J.v.: Modal correspondence theory. Ph.D. thesis, Instituut voor Logica en Grondslagenonderzoek van de Exacte Wetenschappen, Universiteit van Amsterdam (1977)"},{"key":"202_CR8","unstructured":"Blackburn, P., Benthem, J.v., Wolter, F. (eds.): Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3. Elsevier, Amsterdam (2007)"},{"key":"202_CR9","doi-asserted-by":"crossref","unstructured":"Blackburn, P., Rijke, M.d., Venema, Y.: Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge, UK (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"202_CR10","unstructured":"Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks characterizations. In: Proceedings of 4th Israel Symposium on the Theory of Computing and Systems (ISTCS 1996), pp. 16\u201326. IEEE (1996)"},{"key":"202_CR11","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing vector functions on anonymous networks. In: Proceedings of the 4th Colloquium on Structural Information and Communication Complexity (SIROCCO 1997), pp. 201\u2013214. Carleton Scientific (1997)","DOI":"10.1145\/259380.259463"},{"key":"202_CR12","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of 18th Annual ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 181\u2013188. ACM Press (1999). doi: 10.1145\/301308.301355","DOI":"10.1145\/301308.301355"},{"key":"202_CR13","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Proceeedings of 15th International Symposium on Distributed Computing (DISC 2001), Lecture Notes in Computer Science, vol. 2180, pp. 33\u201347. Springer (2001). doi: 10.1007\/3-540-45414-4_3","DOI":"10.1007\/3-540-45414-4_3"},{"key":"202_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, New York (1976)"},{"key":"202_CR15","unstructured":"Chalopin, J.: Algorithmique distribu\u00e9e, calculs locaux et homomorphismes de graphes. Ph.D. thesis, LaBRI, Universit\u00e9 Bordeaux 1 (2006)"},{"key":"202_CR16","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Santoro, N.: Groupings and pairings in anonymous networks. In: Proceedings of the 20th International Symposium on Distributed Computing (DISC 2006), Lecture Notes in Computer Science, vol. 4167, pp. 105\u2013119. Springer (2006). doi: 10.1007\/11864219_8","DOI":"10.1007\/11864219_8"},{"key":"202_CR17","unstructured":"Conradie, W.: Definability and changing perspectives: the beth property for three extensions of modal logic. Master\u2019s thesis, Institute for Logic, Language and Computation, University of Amsterdam (2002)"},{"key":"202_CR18","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010), Lecture Notes in Computer Science, vol. 6343, pp. 148\u2013162. Springer (2010). doi: 10.1007\/978-3-642-15763-9_15","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"202_CR19","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Krzywdzi\u0144ski, K., Szyma\u0144ska, E., Wawrzyniak, W.: Brief announcement: distributed approximations for the semi-matching problem. In: Proceedings of 25th International Symposium on Distributed Computing (DISC 2011), Lecture Notes in Computer Science, vol. 6950, pp. 200\u2013201. Springer (2011). doi: 10.1007\/978-3-642-24100-0_18","DOI":"10.1007\/978-3-642-24100-0_18"},{"key":"202_CR20","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: Proceedings of 22nd International Symposium on Distributed Computing (DISC 2008), Lecture Notes in Computer Science, vol. 5218, pp. 78\u201392. Springer (2008). doi: 10.1007\/978-3-540-87779-0_6","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"202_CR21","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer, Berlin (2010). http:\/\/diestel-graph-theory.com\/","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"1\u20132","key":"202_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(94)00178-L","volume":"145","author":"K Diks","year":"1995","unstructured":"Diks, K., Kranakis, E., Malinowski, A., Pelc, A.: Anonymous wireless rings. Theor. Comput. Sci. 145(1\u20132), 95\u2013109 (1995). doi: 10.1016\/0304-3975(94)00178-L","journal-title":"Theor. Comput. Sci."},{"key":"202_CR23","unstructured":"Emek, Y., Smula, J., Wattenhofer, R.: Stone age distributed computing (2012). arXiv:1202.1186"},{"issue":"4","key":"202_CR24","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic 13(4), 516\u2013520 (1972). doi: 10.1305\/ndjfl\/1093890715","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1\u20133","key":"202_CR25","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0304-3975(02)00592-3","volume":"301","author":"P Flocchini","year":"2003","unstructured":"Flocchini, P., Roncato, A., Santoro, N.: Computing on anonymous networks with sense of direction. Theor. Comput. Sci. 301(1\u20133), 355\u2013379 (2003). doi: 10.1016\/S0304-3975(02)00592-3","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"202_CR26","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/s00224-010-9303-6","volume":"49","author":"P Flor\u00e9en","year":"2011","unstructured":"Flor\u00e9en, P., Hassinen, M., Kaasinen, J., Kaski, P., Musto, T., Suomela, J.: Local approximability of max\u2013min and min\u2013max linear programs. Theory Comput. Syst. 49(4), 672\u2013697 (2011). doi: 10.1007\/s00224-010-9303-6","journal-title":"Theory Comput. Syst."},{"key":"202_CR27","unstructured":"Flor\u00e9en, P., Hassinen, M., Kaski, P., Suomela, J.: Local approximation algorithms for a class of 0\/1 max\u2013min linear programs (2008). arXiv:0806.0282"},{"key":"202_CR28","doi-asserted-by":"crossref","unstructured":"Flor\u00e9en, P., Hassinen, M., Kaski, P., Suomela, J.: Tight local approximation results for max\u2013min linear programs. In: Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2008), Lecture Notes in Computer Science, vol. 5389, pp. 2\u201317. Springer (2008). doi: 10.1007\/978-3-540-92862-1_2 . arXiv:0804.4815.","DOI":"10.1007\/978-3-540-92862-1_2"},{"key":"202_CR29","doi-asserted-by":"crossref","unstructured":"Flor\u00e9en, P., Kaasinen, J., Kaski, P., Suomela, J.: An optimal local approximation algorithm for max-min linear programs. In: Proceedings of 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009), pp. 260\u2013269. ACM Press (2009). doi: 10.1145\/1583991.1584058 . arXiv:0809.1489.","DOI":"10.1145\/1583991.1584058"},{"key":"202_CR30","doi-asserted-by":"crossref","unstructured":"Flor\u00e9en, P., Kaski, P., Musto, T., Suomela, J.: Approximating max-min linear programs with local algorithms. In: Proceedings of 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008). IEEE (2008). doi: 10.1109\/IPDPS.2008.4536235 . arXiv:0710.1499.","DOI":"10.1109\/IPDPS.2008.4536235"},{"key":"202_CR31","doi-asserted-by":"crossref","unstructured":"Flor\u00e9en, P., Kaski, P., Polishchuk, V., Suomela, J.: Almost stable matchings by truncating the Gale\u2013Shapley algorithm. Algorithmica 58(1), 102\u2013118 (2010). doi: 10.1007\/s00453-009-9353-9 . arXiv:0812.4893","DOI":"10.1007\/s00453-009-9353-9"},{"key":"202_CR32","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Hirvonen, J., Suomela, J.: Lower bounds for local approximation. In: Proceedings of 31st Annual ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 175\u2013184. ACM Press (2012). doi: 10.1145\/2332432.2332465 . arXiv:1201.6675.","DOI":"10.1145\/2332432.2332465"},{"issue":"3","key":"202_CR33","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549\u2013587 (1990). doi: 10.1145\/79147.79161","journal-title":"J. ACM"},{"key":"202_CR34","doi-asserted-by":"crossref","unstructured":"Hella, L., J\u00e4rvisalo, M., Kuusisto, A., Laurinharju, J., Lempi\u00e4inen, T., Luosto, K., Suomela, J., Virtema, J.: Weak models of distributed computing, with connections to modal logic. In: Proceedings of 31st Annual ACM Symposium on Principles of Distributed Computing (PODC 2012), pp. 185\u2013194. ACM Press (2012). doi: 10.1145\/2332432.2332466 . arXiv:1205.2051","DOI":"10.1145\/2332432.2332466"},{"key":"202_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity. Graduate Texts in Computer Science","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, Berlin (1999)"},{"key":"202_CR36","unstructured":"Kuhn, F.: The price of locality: exploring the complexity of distributed coordination primitives. Ph.D. thesis, ETH Zurich (2005)"},{"key":"202_CR37","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 980\u2013989. ACM Press (2006). doi: 10.1145\/1109557.1109666 .","DOI":"10.1145\/1109557.1109666"},{"key":"202_CR38","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 7\u201315. ACM Press (2006). doi: 10.1145\/1146381.1146387 .","DOI":"10.1145\/1146381.1146387"},{"key":"202_CR39","unstructured":"Lenzen, C.: Synchronization and symmetry breaking in distributed systems. Ph.D. thesis, ETH Zurich (2011)"},{"key":"202_CR40","unstructured":"Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What can be approximated locally? TIK Report 331, ETH Zurich, Computer Engineering and Networks Laboratory (2010). ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/publications\/TIK-Report-331.pdf"},{"key":"202_CR41","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Wattenhofer, R.: Minimum dominating set approximation in graphs of bounded arboricity. In: Proceedings of 24th International Symposium on Distributed Computing (DISC 2010), Lecture Notes in Computer Science, vol. 6343, pp. 510\u2013524. Springer (2010). doi: 10.1007\/978-3-642-15763-9_48","DOI":"10.1007\/978-3-642-15763-9_48"},{"issue":"1","key":"202_CR42","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). doi: 10.1137\/0221015","journal-title":"SIAM J. Comput."},{"key":"202_CR43","doi-asserted-by":"crossref","unstructured":"Mayer, A., Naor, M., Stockmeyer, L.: Local computations on static and dynamic graphs. In: Proceedings of 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS 1995), pp. 268\u2013278. IEEE (1995). doi: 10.1109\/ISTCS.1995.377023","DOI":"10.1109\/ISTCS.1995.377023"},{"key":"202_CR44","doi-asserted-by":"crossref","unstructured":"Moran, S., Warmuth, M.K.: Gap theorems for distributed computation. SIAM J. Comput. 22(2), 379\u2013394 (1993). doi: 10.1137\/0222028","DOI":"10.1137\/0222028"},{"key":"202_CR45","unstructured":"Moscibroda, T.: Locality, scheduling, and selfishness: algorithmic foundations of highly decentralized networks. Ph.D. thesis, ETH Zurich (2006)"},{"issue":"6","key":"202_CR46","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). doi: 10.1137\/S0097539793254571","journal-title":"SIAM J. Comput."},{"key":"202_CR47","doi-asserted-by":"crossref","unstructured":"Norris, N.: Classifying anonymous networks: when can two networks compute the same set of vector-valued functions? In: Proceedings of 1st Colloquium on Structural Information and Communication Complexity (SIROCCO 1994), pp. 83\u201398. Carleton University Press (1995)","DOI":"10.1515\/9780773591158-006"},{"key":"202_CR48","unstructured":"Norris, N.: Computing functions on partially wireless networks. In: Proceedings 2nd Colloquium on Structural Information and Communication Complexity (SIROCCO 1995), pp. 53\u201364. Carleton University Press (1996)"},{"key":"202_CR49","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"1","key":"202_CR50","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs. Acta Math. 15(1), 193\u2013220 (1891). doi: 10.1007\/BF02392606","journal-title":"Acta Math."},{"key":"202_CR51","doi-asserted-by":"crossref","unstructured":"Polishchuk, V., Suomela, J.: A simple local 3-approximation algorithm for vertex cover. Inform. Process. Lett. 109(12), 642\u2013645 (2009). doi: 10.1016\/j.ipl.2009.02.017 . arXiv:0810.2175","DOI":"10.1016\/j.ipl.2009.02.017"},{"issue":"2","key":"202_CR52","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1005245900406","volume":"64","author":"M Rijke de","year":"2000","unstructured":"de Rijke, M.: A note on graded modal logic. Stud. Log. 64(2), 271\u2013283 (2000). doi: 10.1023\/A:1005245900406","journal-title":"Stud. Log."},{"key":"202_CR53","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), Article 15 (2009). doi: 10.1145\/1516507.1516510","DOI":"10.1145\/1516507.1516510"},{"key":"202_CR54","doi-asserted-by":"crossref","unstructured":"Suomela, J.: Distributed algorithms for edge dominating sets. In: Proceedings of 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), pp. 365\u2013374. ACM Press (2010). doi: 10.1145\/1835698.1835783","DOI":"10.1145\/1835698.1835783"},{"key":"202_CR55","doi-asserted-by":"crossref","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2), 24:1\u201340 (2013). doi: 10.1145\/2431211.2431223 . http:\/\/www.cs.helsinki.fi\/local-survey\/","DOI":"10.1145\/2431211.2431223"},{"key":"202_CR56","doi-asserted-by":"crossref","first-page":"2","DOI":"10.3390\/a1010002","volume":"1","author":"A Wiese","year":"2008","unstructured":"Wiese, A., Kranakis, E.: Impact of locality on location aware unit disk graphs. Algorithms 1, 2\u201329 (2008). doi: 10.3390\/a1010002","journal-title":"Algorithms"},{"key":"202_CR57","doi-asserted-by":"crossref","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601\u2013644 (1983). doi: 10.1103\/RevModPhys.55.601","DOI":"10.1103\/RevModPhys.55.601"},{"key":"202_CR58","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Electing a leader when processor identity numbers are not distinct (extended abstract). In: Proceedings of 3rd International Workshop on Distributed Algorithms (WDAG 1989), Lecture Notes in Computer Science, vol. 392, pp. 303\u2013314. Springer (1989). doi: 10.1007\/3-540-51687-5_52","DOI":"10.1007\/3-540-51687-5_52"},{"issue":"4","key":"202_CR59","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01192691","volume":"29","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing functions on asynchronous anonymous networks. Math. Syst. Theory 29(4), 331\u2013356 (1996). doi: 10.1007\/BF01192691","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"202_CR60","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: part I\u2014characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996). doi: 10.1109\/71.481599","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"202_CR61","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: part II\u2014decision and membership problems. IEEE Trans. Parallel Distrib. Syst. 7(1), 90\u201396 (1996). doi: 10.1109\/71.481600","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"202_CR62","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1109\/71.798313","volume":"10","author":"M Yamashita","year":"1999","unstructured":"Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Parallel Distrib. Syst. 10(9), 878\u2013887 (1999). doi: 10.1109\/71.798313","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0202-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0202-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0202-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T11:20:22Z","timestamp":1688901622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0202-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["202"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0202-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}