{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:25Z","timestamp":1760202685080,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453205"},{"type":"electronic","value":"9783642453212"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-45321-2_8","type":"book-chapter","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T13:48:50Z","timestamp":1417614530000},"page":"168-179","source":"Crossref","is-referenced-by-count":1,"title":["Immunity against Local Influence"],"prefix":"10.1007","author":[{"given":"D.","family":"Peleg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, NY (1992)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jctb.2001.2045","volume":"83","author":"E. Berger","year":"2001","unstructured":"Berger, E.: Dynamic Monopolies of Constant Size. J. Comb. Theory, Ser. B\u00a083, 191\u2013200 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"8_CR3","unstructured":"Bermond, J.-C., Bond, J., Peleg, D., Perennes, S.: Tight bounds on the size of 2-monopolies. In: Proc. 3rd Colloq. on Structural Information & Communication Complexity, pp. 170\u2013179 (1996)"},{"key":"8_CR4","unstructured":"Bermond, J.-C., Peleg, D.: The Power of Small Coalitions in Graphs. In: Proc. 2nd Colloq. on Structural Information & Communication Complexity, pp. 173\u2013184 (1995)"},{"key":"8_CR5","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press (1975)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An o(logn) expected rounds randomized Byzantine generals algorithm. J. ACM\u00a034, 910\u2013920 (1987)","journal-title":"J. ACM"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Computing\u00a017, 975\u2013988 (1988)","journal-title":"SIAM J. Computing"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00388-7","volume":"113","author":"P. Flocchini","year":"2001","unstructured":"Flocchini, P., Geurts, F., Santoro, N.: Optimal irreversible dynamos in chordal rings. Discrete Applied Mathematics\u00a0113, 23\u201342 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Kralovic, R., Ruzicka, P., Roncato, A., Santoro, N.: On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms\u00a01, 129\u2013150 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(03)00261-0","volume":"137","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic monopolies in tori. Discrete Applied Mathematics\u00a0137, 197\u2013212 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. J. ACM\u00a032, 841\u2013860 (1985)","journal-title":"J. ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: Proc. 7th Symp. Oper. Sys. Princip., pp. 150\u2013159 (1979)","DOI":"10.1145\/800215.806583"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(80)90121-1","volume":"30","author":"E. Goles","year":"1980","unstructured":"Goles, E., Olivos, J.: Periodic behaviour of generalized threshold functions. Discrete Mathematics\u00a030, 187\u2013189 (1980)","journal-title":"Discrete Mathematics"},{"key":"8_CR14","volume-title":"Combinatorial Theory","author":"M. Hall","year":"1986","unstructured":"Hall, M.: Combinatorial Theory. John Wiley & Sons, Chichester (1986)"},{"key":"8_CR15","unstructured":"Hassin, Y., Peleg, D.: Extremal Bounds for Proabilistic Polling in Graphs. In: Proc. 7th Colloq. on Structural Information & Communication Complexity, pp. 167\u2013180 (2000)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y. Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Information and Computation\u00a0171, 248\u2013268 (2001)","journal-title":"Information and Computation"},{"key":"8_CR17","unstructured":"Jalote, P., Rangarajan, S., Tripathi, S.K.: Capacity of voting systems. Technical Report UMIACS-TR-91-118, University of Maryland (1991)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1145\/210118.210136","volume":"42","author":"N. Kahale","year":"1995","unstructured":"Kahale, N.: Eigenvalues and expansion of regular graphs. J. ACM\u00a042, 1091\u20131106 (1995)","journal-title":"J. ACM"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1006\/jagm.1998.0972","volume":"30","author":"S. Kutten","year":"1999","unstructured":"Kutten, S., Peleg, D.: Fault-local distributed mending. J. of Algorithms\u00a030, 144\u2013165 (1999)","journal-title":"J. of Algorithms"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539797319109","volume":"30","author":"S. Kutten","year":"2000","unstructured":"Kutten, S., Peleg, D.: Tight fault-locality. SIAM J. on Computing\u00a030, 247\u2013268 (2000)","journal-title":"SIAM J. on Computing"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Programming Languages and Systems\u00a04, 382\u2013401 (1982)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Linial, N., Peleg, D., Rabinovich, Y., Saks, M.: Sphere packing and local majorities in graphs. In: Proc. 2nd ISTCS, pp. 141\u2013149. IEEE (1993)","DOI":"10.1109\/ISTCS.1993.253475"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0129054107004784","volume":"18","author":"F. Luccio","year":"2007","unstructured":"Luccio, F., Pagli, L., Santoro, N.: Network decontamination in Presence of Local Immunity. Int. J. Found. Comput. Sci.\u00a018, 457\u2013474 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1090\/S0002-9947-1995-1297535-1","volume":"347","author":"G. Moran","year":"1995","unstructured":"Moran, G.: On the period-two-property of the majority operator in infinite graphs. Trans. American Math. Society\u00a0347, 1649\u20131667 (1995)","journal-title":"Trans. American Math. Society"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0012-365X(94)90237-2","volume":"132","author":"G. Moran","year":"1994","unstructured":"Moran, G.: Parametrization for stationary patterns of the r-majority operators on 0-1 sequences. Discrete Mathematics\u00a0132, 175\u2013195 (1994)","journal-title":"Discrete Mathematics"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(94)90236-4","volume":"132","author":"G. Moran","year":"1994","unstructured":"Moran, G.: The r-majority vote action on 0-1 sequences. Discrete Mathematics\u00a0132, 145\u2013174 (1994)","journal-title":"Discrete Mathematics"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D. Peleg","year":"2002","unstructured":"Peleg, D.: Local Majorities, Coalitions and Monopolies in Graphs: A Review. Theoretical Computer Science\u00a0282, 231\u2013257 (2002)","journal-title":"Theoretical Computer Science"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(98)00043-2","volume":"86","author":"D. Peleg","year":"1998","unstructured":"Peleg, D.: Size Bounds for Dynamic Monopolies. Discrete Applied Mathematics\u00a086, 263\u2013273 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF02579347","volume":"3","author":"S. Poljak","year":"1983","unstructured":"Poljak, S., Sura, M.: On periodical behaviour in societies with symmetric influences. Combinatorica\u00a03, 119\u2013121 (1983)","journal-title":"Combinatorica"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(86)90066-1","volume":"13","author":"S. Poljak","year":"1986","unstructured":"Poljak, S., Turzik, D.: On an application of convexity to discrete systems. Discrete Applied Mathematics\u00a013, 27\u201332 (1986)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Sipser, M., Spielman, D.: Expander codes. In: 35th IEEE Symp. on Foundations of Computer Science, pp. 566\u2013576 (1994)","DOI":"10.1109\/SFCS.1994.365734"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/71.262589","volume":"5","author":"M. Spasojevic","year":"1994","unstructured":"Spasojevic, M., Berman, P.: Voting as the optimal static pessimistic scheme for managing replicated data. IEEE Trans. Parallel & Distr. Systems\u00a05, 64\u201373 (1994)","journal-title":"IEEE Trans. Parallel & Distr. Systems"}],"container-title":["Lecture Notes in Computer Science","Language, Culture, Computation. Computing - Theory and Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45321-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:49:11Z","timestamp":1747176551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45321-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642453205","9783642453212"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45321-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}