{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T22:28:50Z","timestamp":1677968930545},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,10,17]],"date-time":"2005-10-17T00:00:00Z","timestamp":1129507200000},"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":[[2006,2]]},"DOI":"10.1007\/s00446-005-0145-4","type":"journal-article","created":{"date-parts":[[2006,1,16]],"date-time":"2006-01-16T09:54:13Z","timestamp":1137405253000},"page":"209-219","source":"Crossref","is-referenced-by-count":19,"title":["Relationships between broadcast and shared memory in reliable anonymous distributed systems"],"prefix":"10.1007","volume":"18","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[]},{"given":"Faith Ellen","family":"Fich","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,17]]},"reference":[{"key":"145_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"145_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Fich, F., Ruppert, E.: Relationships between broadcast and shared memory in reliable anonymous distributed systems. In: Proc. 18th International Symposium on Distributed Computing, LNCS, vol. 3274, pp. 260\u2013274 (2004)","DOI":"10.1007\/978-3-540-30186-8_19"},{"key":"145_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shah, G., Shah, J.: Wait-free consensus with infinite arrivals. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 524\u2013533 (2002)","DOI":"10.1145\/509907.509983"},{"issue":"2","key":"145_CR4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Information and Computation 173(2), 162\u2013183 (2002)","journal-title":"Information and Computation"},{"key":"145_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd ed. Wiley-Interscience (2004)","DOI":"10.1002\/0471478210"},{"key":"145_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301355"},{"key":"145_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Distributed Computing, 15th International Conference, LNCS, vol. 2180, pp. 33\u201347 (2001)","DOI":"10.1007\/3-540-45414-4_3"},{"key":"145_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vitanyi, P.: On the importance of having an identity or, is consensus really universal? In: Distributed Computing, 14th International Conference, LNCS, vol. 1914, pp. 134\u2013148 (2000)","DOI":"10.1007\/3-540-40026-5_9"},{"key":"145_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, T.D.: Polylog randomized wait-free consensus. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, pp. 166\u2013175 (1996)","DOI":"10.1145\/248052.248083"},{"key":"145_CR10","unstructured":"Drul\u0103, C.: The totally anonymous shared memory model in which the number of processes is known. Personal communication."},{"issue":"1","key":"145_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02283568","volume":"8","author":"O. E\u011fecio\u011flu","year":"1994","unstructured":"E\u011fecio\u011flu, O., Singh, A.K.: Naming symmetric processes using shared variables. Distributed Computing 8(1), 19\u201338 (1994)","journal-title":"Distributed Computing"},{"issue":"2\u20133","key":"145_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2\u20133), 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"key":"145_CR13","doi-asserted-by":"crossref","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9) (1960)","DOI":"10.1145\/367390.367400"},{"key":"145_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: Proc. 19th International Symposium on Distributed Computing, LNCS, vol. 3724, pp. 244\u2013259 (2005)","DOI":"10.1007\/11561927_19"},{"issue":"3","key":"145_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Progr. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"issue":"4","key":"145_CR16","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti, P.: Robust wait-free hierarchies. J. ACM 44(4), 592\u2013614 (1997)","journal-title":"J. ACM"},{"issue":"3","key":"145_CR17","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S0097539795280081","volume":"28","author":"P. Jayanti","year":"1998","unstructured":"Jayanti, P.: Solvability of consensus: Composition breaks down for nondeterministic types. SIAM J. Comput. 28(3), 782\u2013797 (1998)","journal-title":"SIAM J. Comput."},{"key":"145_CR18","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Wakeup under read\/write atomicity. In: Distributed Algorithms, 4th International Workshop, LNCS, vol. 486, pp. 277\u2013288 (1990)","DOI":"10.1007\/3-540-54099-7_19"},{"issue":"2","key":"145_CR19","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1006\/jagm.2000.1110","volume":"37","author":"S. Kutten","year":"2000","unstructured":"Kutten, S., Ostrovsky, R., Patt-Shamir, B.: The Las-Vegas processor identity problem (How and when to be unique). Journal of Algorithms 37(2), 468\u2013494 (2000)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"145_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(90)90103-5","volume":"36","author":"R.J. Lipton","year":"1990","unstructured":"Lipton, R.J., Park, A.: The processor identity problem. Inf. Process. Lett. 36(2), 91\u201394 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"145_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s004460050045","volume":"11","author":"A. Panconesi","year":"1998","unstructured":"Panconesi, A., Papatriantafilou, M., Tsigas, P., Vit\u00e1nyi, P.: Randomized naming using wait-free shared variables. Distributed Computing 11(3), 113\u2013124 (1998)","journal-title":"Distributed Computing"},{"key":"145_CR22","unstructured":"Reif, J.H. (ed.): Synthesis of Parallel Algorithms. Morgan Kaufmann (1993)"},{"key":"145_CR23","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"key":"145_CR24","unstructured":"Shapiro, H.N.: Introduction to the Theory of Numbers. John Wiley and Sons (1983)"},{"issue":"3","key":"145_CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(90)90094-E","volume":"34","author":"S.H. Teng","year":"1990","unstructured":"Teng, S.H.: Space efficient processor identity protocol. Inf. Process. Lett. 34(3), 147\u2013154 (1990)","journal-title":"Inf. Process. Lett."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0145-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0145-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0145-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T03:26:04Z","timestamp":1586661964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0145-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,17]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0145-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,17]]}}}