{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:55Z","timestamp":1725548935994},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_17","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"206-217","source":"Crossref","is-referenced-by-count":2,"title":["Three Optimal Algorithms for Balls of Three Colors"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kyn\u010dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_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. Discrete Applied Mathematics\u00a0137, 3\u201325 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-24749-4_45","volume-title":"STACS 2004","author":"M. Aigner","year":"2004","unstructured":"Aigner, M., De Marco, G., Montangero, M.: The plurality problem with three colors. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 513\u2013521. Springer, Heidelberg (2004)"},{"key":"17_CR3","unstructured":"Aigner, M., De Marco, G., Montangero, M.: The plurality problem with three colors and more (submitted)"},{"key":"17_CR4","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.M., Schott, R.: Determining the majority. Information Processing Letters\u00a047, 253\u2013255 (1993)","journal-title":"Information Processing Letters"},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. John Wiley & Sons, Chichester (1991)"},{"key":"17_CR6","first-page":"375","volume":"3","author":"M. Fisher","year":"1982","unstructured":"Fisher, M., Salzberg, S.: Finding a majority among n votes. Journal of Algorithms\u00a03, 375\u2013379 (1982)","journal-title":"Journal of Algorithms"},{"key":"17_CR7","unstructured":"Kr\u00e1l\u2019, D., Sgall, J., Tich\u00fd, T.: Randomized strategies for the plurality problem (in preparation)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-540-45138-9_31","volume-title":"Mathematical Foundations of Computer Science 2003","author":"G. Marco De","year":"2003","unstructured":"De Marco, G., Pelc, A.: Randomized algorithms for determining the majority on graphs. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 368\u2013377. Springer, Heidelberg (2003)"},{"key":"17_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502081.001.0001","volume-title":"Invitation to discrete mathematics","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J., Ne\u0161et\u0159il, J.: Invitation to discrete mathematics. Oxford University Press, Oxford (1998)"},{"key":"17_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"17_CR11","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":"17_CR12","unstructured":"Srivastava, N.: Tight bounds on plurality using equality tests (2003) (unpublished manuscript)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. of the 17th Annual Symposium on Foundations of Computer Science (FOCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T15:14:56Z","timestamp":1711293296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}