{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:53Z","timestamp":1725515033768},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72870-2_21","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:53:10Z","timestamp":1182761590000},"page":"221-230","source":"Crossref","is-referenced-by-count":0,"title":["How to Play the Majority Game with Liars"],"prefix":"10.1007","author":[{"given":"Steve","family":"Butler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00186-0","volume":"137","author":"M. Aigner","year":"2004","unstructured":"Aigner, M.: Variants of the majority problem. Applied Discrete Mathematics\u00a0137, 3\u201325 (2004)","journal-title":"Applied Discrete Mathematics"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.tcs.2004.12.035","volume":"337","author":"M. Aigner","year":"2005","unstructured":"Aigner, M., De Marco, G., Montangero, M.: The plurality problem with three colors and more. Theoretical Computer Science\u00a0337, 319\u2013330 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(93)90135-V","volume":"47","author":"L. Alonso","year":"1993","unstructured":"Alonso, L., Reingold, E., Schott, R.: Determining the majority. Information Processing Letters\u00a047, 253\u2013255 (1993)","journal-title":"Information Processing Letters"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539794275914","volume":"26","author":"L. Alonso","year":"1997","unstructured":"Alonso, L., Reingold, E., Schott, R.: Average-case complexity of determining the majority. SIAM J. Computing\u00a026, 1\u201314 (1997)","journal-title":"SIAM J. Computing"},{"key":"21_CR5","unstructured":"Alonso, L., Reingold, E.: Determining plurality. Manuscript (2006)"},{"key":"21_CR6","unstructured":"Chung, F.R.K., Graham, R.L., Mao, J., Yao, A.C.: Finding favorites. ECCC Report TR03-078, Electronic Colloquium on Computational Complexity (2003)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11533719_34","volume-title":"Computing and Combinatorics","author":"F.R.K. Chung","year":"2005","unstructured":"Chung, F.R.K., Graham, R.L., Mao, J., Yao, A.C.: Oblivious and adaptive strategies for the majority and plurality problems. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 329\u2013338. Springer, Heidelberg (2005)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-540-31856-9_17","volume-title":"STACS 2005","author":"Z. Dvo\u0159\u00e1k","year":"2005","unstructured":"Dvo\u0159\u00e1k, Z., Jel\u00ednek, V., Kr\u00e1l\u2019, D., Kyn\u010dl, J., Saks, M.: Three optimal algorithms for balls of three colors. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 206\u2013217. Springer, Heidelberg (2005)"},{"key":"21_CR9","first-page":"375","volume":"3","author":"M.J. Fischer","year":"1982","unstructured":"Fischer, M.J., Salzberg, S.L.: Finding a majority among n votes. J. Algorithms\u00a03, 375\u2013379 (1982)","journal-title":"J. Algorithms"},{"key":"21_CR10","unstructured":"Kral, D., Sgall, J., Tich\u1ef3, T.: Randomized strategies for the plurality problem. Manuscript (2005)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(81)90022-5","volume":"2","author":"J. Moore","year":"1981","unstructured":"Moore, J.: Proposed problem 81-5. J. Algorithms\u00a02, 208\u2013210 (1981)","journal-title":"J. Algorithms"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","volume":"270","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Searching games with errors \u2014 fifty years of coping with liars. Theoret. Comput. Sci.\u00a0270, 71\u2013109 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR13","first-page":"505","volume":"6","author":"A. R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On a problem in information theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a06, 505\u2013516 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01275672","volume":"11","author":"M. Saks","year":"1991","unstructured":"Saks, M., Werman, M.: On computing majority by comparisons. Combinatorica\u00a011, 383\u2013387 (1991)","journal-title":"Combinatorica"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ipl.2005.06.004","volume":"96","author":"N. Srivastava","year":"2005","unstructured":"Srivastava, N., Taylor, A.D.: Tight bounds on plurality. Information Processing Letters\u00a096, 93\u201395 (2005)","journal-title":"Information Processing Letters"},{"key":"21_CR16","volume-title":"Adventures of a mathematician","author":"S.M. Ulam","year":"1976","unstructured":"Ulam, S.M.: Adventures of a mathematician. Charles Scribner\u2019s Sons, New York (1976)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0378-3758(01)00142-2","volume":"100","author":"G. Wiener","year":"2002","unstructured":"Wiener, G.: Search for a majority element. J. Statistical Planning and Inference\u00a0100, 313\u2013318 (2002)","journal-title":"J. Statistical Planning and Inference"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:51:07Z","timestamp":1558259467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540728689","9783540728702"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}