{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:36Z","timestamp":1725851976716},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_29","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"390-402","source":"Crossref","is-referenced-by-count":0,"title":["From Discrepancy to Majority"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Daniel S.","family":"Hirschberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"29_CR1","series-title":"Ser. Appl. Math.","volume-title":"Combinatorial Group Testing and its Applications","author":"DZ Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. Ser. Appl. Math., vol. 12, 2nd edn. World Scientific, New York (2000)","edition":"2"},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/050631847","volume":"36","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36(5), 1360\u20131375 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: Short monotone formulae for the majority function. J. Algor. 5(3), 363\u2013366 (1984)","journal-title":"J. Algor."},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-40104-6_28","volume-title":"Algorithms and Data Structures","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Combinatorial pair testing: distinguishing workers from slackers. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 316\u2013327. Springer, Heidelberg (2013)"},{"issue":"2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1550009","DOI":"10.1142\/S1793830915500093","volume":"7","author":"G Marco De","year":"2015","unstructured":"De Marco, G., Kranakis, E.: Searching for majority with \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -tuple queries. Discrete Math. Algor. Appl. 7(2), 1550009 (2015)","journal-title":"Discrete Math. Algor. Appl."},{"issue":"5","key":"29_CR6","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. Inform. Process. Lett. 47(5), 253\u2013255 (1993)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"29_CR7","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 J. Comput. 26(1), 1\u201314 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01275672","volume":"11","author":"ME Saks","year":"1991","unstructured":"Saks, M.E., Werman, M.: On computing majority by comparisons. Combinatorica 11(4), 383\u2013387 (1991)","journal-title":"Combinatorica"},{"key":"29_CR9","series-title":"Cambridge Tracts in Mathematics","volume-title":"Irregularities of Distribution","author":"J Beck","year":"2008","unstructured":"Beck, J., Chen, W.W.L.: Irregularities of Distribution. Cambridge Tracts in Mathematics, vol. 89. Cambridge University Press, Cambridge (2008)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Gerbner, D., Keszegh, B., P\u00e1lv\u00f6lgyi, D., Patk\u00f3s, B., Vizer, M., Wiener, G.: Finding a majority ball with majority answers. In: Proceedings of the 8th European Conference on Combinatorics, Graph Theory, and Applications (EuroComb 2015). Elect. Notes Discrete Math., vol. 49, pp. 345\u2013351. Elsevier (2015)","DOI":"10.1016\/j.endm.2015.06.047"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:29:51Z","timestamp":1559424591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}