{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T18:02:46Z","timestamp":1791309766193,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_30","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T12:25:18Z","timestamp":1169555118000},"page":"396-411","source":"Crossref","is-referenced-by-count":16,"title":["On the Power of Anonymous One-Way Communication"],"prefix":"10.1007","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Eisenstat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"30_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":"30_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: IEEE\/ACM International Conference on Distributed Computing in Sensor Systems (June 2005)","DOI":"10.1007\/11502593_8"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299 (2004)","DOI":"10.1145\/1011767.1011810"},{"key":"30_CR4","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":"30_CR5","doi-asserted-by":"publisher","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\u00a0173(2), 162\u2013183 (2002)","journal-title":"Information and Computation"},{"key":"30_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":"30_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Distributed Computing, 15th International Conference, pp. 33\u201347 (2001)","DOI":"10.1007\/3-540-45414-4_3"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00446-005-0121-z","volume":"18","author":"H. Buhrman","year":"2006","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vitanyi, P.: On the importance of having an identity or, is consensus really universal? Distributed Computing\u00a018(3), 167\u2013176 (2006)","journal-title":"Distributed Computing"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1093\/imamat\/1.1.42","volume":"1","author":"D.J. Daley","year":"1965","unstructured":"Daley, D.J., Kendall, D.G.: Stochastic rumours. Journal of the Institute of Mathematics and its Applications\u00a01, 42\u201355 (1965)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"issue":"1\u20132","key":"30_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF03160228","volume":"6","author":"Z. Diamadi","year":"2001","unstructured":"Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences\u00a06(1\u20132), 72\u201382 (2001) (Also appears as Yale Technical Report TR\u20131207, January 2001)","journal-title":"Wuhan University Journal of Natural Sciences"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02283568","volume":"8","author":"\u00d6. E\u011fecio\u011flu","year":"1994","unstructured":"E\u011fecio\u011flu, \u00d6., Singh, A.K.: Naming symmetric processes using shared variables. Distributed Computing\u00a08(1), 19\u201338 (1994)","journal-title":"Distributed Computing"},{"issue":"2-3","key":"30_CR12","doi-asserted-by":"publisher","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\u00a016(2-3), 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/0378-4371(92)90283-V","volume":"188","author":"D.T. Gillespie","year":"1992","unstructured":"Gillespie, D.T.: A rigorous derivation of the chemical master equation. Physica A\u00a0188, 404\u2013425 (1992)","journal-title":"Physica A"},{"key":"30_CR14","volume-title":"The Mathematical Theory of Context Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context Free Languages. McGraw-Hill, New York (1966)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: 19th International Symposium on Distributed Computing, pp. 244\u2013259 (2005)","DOI":"10.1007\/11561927_19"},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society\u00a03(2), 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-54099-7_19","volume-title":"Distributed Algorithms","author":"P. Jayanti","year":"1991","unstructured":"Jayanti, P., Toueg, S.: Wakeup under read\/write atomicity. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol.\u00a0486, pp. 277\u2013288. Springer, Heidelberg (1991)"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","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\u00a037(2), 468\u2013494 (2000)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"30_CR19","doi-asserted-by":"publisher","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. Information Processing Letters\u00a036(2), 91\u201394 (1990)","journal-title":"Information Processing Letters"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","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\u00a011(3), 113\u2013124 (1998)","journal-title":"Distributed Computing"},{"key":"30_CR21","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congr\u00e8s de Math\u00e9maticiens des Pays Slaves, Warszawa, pp. 92\u2013101 (1929)"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proc. 18th ACM Symposium on Principles of Distributed Computing, pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"issue":"3","key":"30_CR23","doi-asserted-by":"publisher","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. Information Processing Letters\u00a034(3), 147\u2013154 (1990)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:59:42Z","timestamp":1556060382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11795490_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}