{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:55:42Z","timestamp":1725641742026},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_14","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"191-206","source":"Crossref","is-referenced-by-count":3,"title":["Communication Complexity of Consensus in Anonymous Message Passing Systems"],"prefix":"10.1007","author":[{"given":"Emanuele G.","family":"Fusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM\u00a035, 845\u2013875 (1988)","journal-title":"Journal of the ACM"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0196-6774(91)90002-G","volume":"12","author":"H. Attiya","year":"1991","unstructured":"Attiya, H., Snir, M.: Better Computing on the Anonymous Ring. Journal of Algorithms\u00a012, 204\u2013238 (1991)","journal-title":"Journal of Algorithms"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons, Inc. (2004)","DOI":"10.1002\/0471478210"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC), pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"14_CR6","unstructured":"Burns, J.E.: A formal model for message passing systems, Tech. Report TR-91, Computer Science Department. Indiana University, Bloomington (September 1980)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing\u00a015, 27\u201338 (2002)","journal-title":"Distributed Computing"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11523468_29","volume-title":"Automata, Languages and Programming","author":"B.S. Chlebus","year":"2005","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Kowalski, D.R., Radzik, T.: On the Wake-Up Problem in Radio Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 347\u2013359. Springer, Heidelberg (2005)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 266\u2013274 (2004)","DOI":"10.1145\/1011767.1011806"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-15763-9_24","volume-title":"Distributed Computing","author":"B.S. Chlebus","year":"2010","unstructured":"Chlebus, B.S., Kowalski, D.R., Strojnowski, M.: Scalable Quantum Consensus for Crash Failures. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 236\u2013250. Springer, Heidelberg (2010)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00446-008-0056-2","volume":"21","author":"G. Chockler","year":"2008","unstructured":"Chockler, G., Demirbas, M., Gilbert, S., Lynch, N.A., Newport, C.C., Nolte, T.: Consensus and collision detectors in radio networks. Distributed Computing\u00a021, 55\u201384 (2008)","journal-title":"Distributed Computing"},{"key":"14_CR12","unstructured":"Chrobak, M., Gasieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 985\u2013993 (2004)"},{"key":"14_CR13","unstructured":"Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: Proc. 4th Israel Symposium on Theory of Computing and Systems (ISTCS 1996), pp. 16\u201326 (1996)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with un- known topology. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-04355-0_51","volume-title":"Distributed Computing","author":"J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Consensus and Mutual Exclusion in a Multiple Access Channel. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 512\u2013526. Springer, Heidelberg (2009)"},{"key":"14_CR16","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0145, 95\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. Gasieniec","year":"2001","unstructured":"Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics\u00a014, 207\u2013222 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Kowalski, D.R.: Distributed agreement with optimal communication complexity. In: Proc. 21st ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 965\u2013977 (2010)","DOI":"10.1137\/1.9781611973075.78"},{"key":"14_CR19","unstructured":"Kranakis, E.: Symmetry and Computability in Anonymous Networks: A Brief Survey. In: Proc. 3rd Int. Conf. on Structural Information and Communication Complexity, pp. 1\u201316 (1997)"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"14_CR21","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publ., Inc. (1996)"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM\u00a027, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-Tolerant Agreement in Synchronous Distributed Systems. Morgan & Claypool Publishers (2010)","DOI":"10.2200\/S00294ED1V01Y201009DCT003"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC 1999), pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proc. 7th ACM Symp. on Principles of Distributed Computing (PODC 1988), pp. 117\u2013130 (1988)","DOI":"10.1145\/62546.62568"},{"key":"14_CR26","doi-asserted-by":"publisher","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 - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:53:02Z","timestamp":1561031582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}