{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:45Z","timestamp":1725600465008},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_52","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"604-615","source":"Crossref","is-referenced-by-count":1,"title":["Computing Majority with Triple Queries"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"G\u00e1bor","family":"Wiener","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","volume-title":"Combinatorial Search","author":"M. Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. Wiley, Chichester (1988)"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-32777-6_1","volume":"16","author":"M. Aigner","year":"2007","unstructured":"Aigner, M.: Two colors and more. Entropy, Search, Complexity Bolyai Society Mathematical Studies\u00a016, 9\u201326 (2007)","journal-title":"Entropy, Search, Complexity Bolyai Society Mathematical Studies"},{"issue":"1","key":"52_CR3","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(1), 3\u201326 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR4","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":"52_CR5","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":"52_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539794275914","volume":"26","author":"L. Alonso","year":"1997","unstructured":"Alonso, L., Reingold, E.M., Schott, R.: The average-case complexity of determining the majority. SIAM Journal on Computing\u00a026, 1\u201314 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR7","unstructured":"Alonso, L., Chassaing, P., Reingold, E.M., Schott, R.: The chip problem (preprint), \n                  \n                    http:\/\/emr.cs.uiuc.edu\/~reingold\/chips.ps"},{"key":"52_CR8","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":"52_CR9","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":"52_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/rsa.20148","volume":"30","author":"Z. Dvo\u0159\u00e1k","year":"2007","unstructured":"Dvo\u0159\u00e1k, Z., Jel\u00ednek, V., Kr\u00e1l, D., Kyn\u010dl, J., Saks, M.: Probabilistic strategies for the partition and plurality problems. Random Structures and Algorithms\u00a030, 63\u201377 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"52_CR11","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":"52_CR12","first-page":"116","volume":"38","author":"D. K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Graphen und Matrizen. Math. Fiz. Lapok\u00a038, 116\u2013119 (1931)","journal-title":"Math. Fiz. Lapok"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1016\/j.dam.2008.05.014","volume":"156","author":"D. Kr\u00e1l","year":"2008","unstructured":"Kr\u00e1l, D., Sgall, J., Tich\u1ef3, T.: Randomized Strategies for the plurality problem. Discrete Applied Mathematics\u00a0156, 3305\u20133311 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"F.P. Preparata","year":"1967","unstructured":"Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Trans. on Electronic Computers\u00a016, 848\u2013854 (1967)","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01275672","volume":"11","author":"M.E. Saks","year":"1991","unstructured":"Saks, M.E., Werman, M.: On computing majority by comparisons. Combinatorica\u00a011, 383\u2013387 (1991)","journal-title":"Combinatorica"},{"key":"52_CR16","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. Journal of Statistical Planning and Inference\u00a0100, 313\u2013318 (2002)","journal-title":"Journal of Statistical Planning and Inference"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T05:17:43Z","timestamp":1554009463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}