{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:40:03Z","timestamp":1748554803452,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319217406"},{"type":"electronic","value":"9783319217413"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21741-3_5","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T12:21:28Z","timestamp":1438604488000},"page":"67-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Match-Maker: Constant-Space Distributed Majority via Random Walks"],"prefix":"10.1007","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David D.","family":"Hamilton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proc. 20th Annual Symposium on Foundations of Computer Science, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"5_CR2","unstructured":"Alon, N., Spencer, J.H., Erd\u00f6s, P.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley (1992)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distributed Computing 21(2), 87\u2013102 (2008)","journal-title":"Distributed Computing"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30186-8_20","volume-title":"Distributed Computing","author":"Y Birk","year":"2004","unstructured":"Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 275\u2013289. Springer, Heidelberg (2004)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ezhilchelvan, P., Mostefaoui, A., Raynal, M.: Randomized multivalued consensus. In: Proc. of Fourth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, ISORC - 2001, pp. 195\u2013200 (2001)","DOI":"10.1109\/ISORC.2001.922837"},{"key":"5_CR7","unstructured":"Feige, U.: Collecting coupons on trees, and the analysis of random walks. Technical report CS93-20 of the Weizmann Institute (1993)"},{"key":"5_CR8","volume-title":"An Introduction to Probability Theory and its Applications","author":"W Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1, 3rd edn. Wiley, New York (1968)","edition":"3"},{"key":"5_CR9","unstructured":"Goemans, M.X.: Lecture notes on bipartite matchings (2009). http:\/\/www-math.mit.edu\/~goemans\/18433S09\/matching-notes.pdf"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/978-3-662-43948-7_72","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2014","unstructured":"Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 871\u2013882. Springer, Heidelberg (2014)"},{"issue":"5\u20136","key":"5_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(00)00027-2","volume":"73","author":"A Mostefaoui","year":"2000","unstructured":"Mostefaoui, A., Raynal, M., Tronel, F.: From binary consensus to multivalued consensus in asynchronous message-passing systems. Information Processing Letters 73(5\u20136), 207\u2013212 (2000)","journal-title":"Information Processing Letters"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"5_CR13","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Ch 11, exercise 5(c). Prentice-Hall, Inc., NJ (1982)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21741-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:15:59Z","timestamp":1748553359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21741-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319217406","9783319217413"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21741-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}