{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:27Z","timestamp":1725619107696},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"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-24550-3_15","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"178-192","source":"Crossref","is-referenced-by-count":2,"title":["The South Zone: Distributed Algorithms for Alliances"],"prefix":"10.1007","author":[{"given":"M. C.","family":"Dourado","sequence":"first","affiliation":[]},{"given":"L. D.","family":"Penso","sequence":"additional","affiliation":[]},{"given":"D.","family":"Rautenbach","sequence":"additional","affiliation":[]},{"given":"J. L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing\u00a021(3), 183\u2013199 (2008)","journal-title":"Distributed Computing"},{"key":"#cr-split#-15_CR2.1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing\u00a020(4), 279-304 (2007);","DOI":"10.1007\/s00446-007-0040-2"},{"key":"#cr-split#-15_CR2.2","unstructured":"PODC 2006, Special Issue"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 223\u2013237. Springer, Heidelberg (2000)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms\u00a015, 385\u2013415 (1993)","journal-title":"Journal of Algorithms"},{"key":"15_CR5","unstructured":"Centeno, C., Dourado, M.C., Penso, L.D., Rautenbach, D., Szwarcfiter, J.L.: Irreversible Conversions on Graphs. Accepted in Theoretical Computer Science (to appear)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dourado, M.C., Penso, L.D., Rautenbach, D., Szwarcfiter, J.L.: On Reversible and Irreversible Conversions. In: International Symposium on Distributed Computing (DISC 2010), pp. 395-397 (September 2010)","DOI":"10.1007\/978-3-642-15763-9_37"},{"key":"15_CR7","unstructured":"Dourado, M.C., Penso, L.D., Rautenbach, D., Szwarcfiter, J.L.: Reversible Iterative Graph Processes (under submission)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017, 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"15_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"issue":"7","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"P.A. Dreyer Jr.","year":"2009","unstructured":"Dreyer Jr., P.A., Roberts, F.S.: Irreversible k-Threshold Processes: Graph-Theoretical Threshold Models of the Spread of Disease and of Opinion. Discrete Applied Mathematics\u00a0157(7), 1615\u20131627 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11780823_27","volume-title":"Structural Information and Communication Complexity","author":"W. Goddard","year":"2006","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.D., Trevisan, V.: Distance-k Information in Self-Stabilizing Algorithms. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 349\u2013356. Springer, Heidelberg (2006)"},{"key":"15_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Maggs, B.M., Oprea, F., Reiter, M.K.: Quorum Placement in Networks to Minimize Access Delays. In: ACM Symposium on Principles of Distributed Computing, PODC 2005 (July 2005)","DOI":"10.1145\/1073814.1073829"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Golovin, D., Gupta, A., Maggs, B.M., Oprea, F., Reiter, M.K.: Quorum Placement in Networks: Minimizing Network Congestion. In: ACM Symposium on Principles of Distributed Computing, PODC 2006 (July 2006)","DOI":"10.1145\/1146381.1146388"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/77600.77616","volume":"37","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M.: Concurrency and Availability as Dual Properties of Replicated Atomic Data. Journal of the ACM\u00a037(2), 257\u2013278 (1990)","journal-title":"Journal of the ACM"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Hassin, Y., Peleg, D.: Average Probe Complexity in Quorum Systems. In: ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 180\u2013189 (August 2001)","DOI":"10.1145\/383962.384014"},{"key":"15_CR17","unstructured":"Jamieson, L.H.: Algorithms and Complexities for Alliances and Weighted Alliances of Various Types. Clemson University (May 2007)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: ACM Symposium on Principles of Distributed Computing, PODC 2003 (July 2003)","DOI":"10.1145\/872035.872040"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jagm.1998.0929","volume":"28","author":"S. Kutten","year":"1998","unstructured":"Kutten, S., Peleg, D.: Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms\u00a028(1), 40\u201366 (1998)","journal-title":"Journal of Algorithms"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-642-15763-9_48","volume-title":"Distributed Computing","author":"C. Lenzen","year":"2010","unstructured":"Lenzen, C., Wattenhofer, R.: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 510\u2013524. Springer, Heidelberg (2010)"},{"key":"15_CR21","unstructured":"Peleg, D.: Majority Voting, Coalitions and Monopolies in Graphs. In: International Symposium in Structured Information and Communication Complexity (SIROCCO 1996), pp. 152\u2013169 (June 1996)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. Journal of ACM\u00a036, 510\u2013530 (1989)","journal-title":"Journal of ACM"},{"issue":"1-3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0166-218X(03)00368-8","volume":"141","author":"L.D. Penso","year":"2004","unstructured":"Penso, L.D., Barbosa, V.: A Distributed Algorithm for Finding k-Dominating Sets. Discrete Applied Mathematics\u00a0141(1-3), 243\u2013253 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.aml.2006.03.006","volume":"20","author":"D. Rautenbach","year":"2007","unstructured":"Rautenbach, D., Volkmann, L.: New Bounds on the k-domination number and on the k-tuple domination number. Applied Mathematics Letters\u00a020(1), 98\u2013102 (2007)","journal-title":"Applied Mathematics Letters"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/151254.151256","volume":"25","author":"M. Schneider","year":"1993","unstructured":"Schneider, M.: Self-Stabilization. ACM Computing Surveys\u00a025(1), 45\u201367 (1993)","journal-title":"ACM Computing Surveys"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Srimani, P.K., Xu, Z.: Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization. In: International Conference on Computing: Theory and Applications (ICCTA 2007), pp. 27\u201331 (2007)","DOI":"10.1109\/ICCTA.2007.54"},{"key":"15_CR27","volume-title":"Multicast Communication: Protocols and Applications","author":"R. Wittmann","year":"2001","unstructured":"Wittmann, R., Zitterbart, M.: Multicast Communication: Protocols and Applications. Morgan Kaufmann, San Francisco (2001)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T02:53:44Z","timestamp":1560740024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}