{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:22:21Z","timestamp":1777454541575,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450426","type":"print"},{"value":"9783642450433","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_34","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T09:05:50Z","timestamp":1384247150000},"page":"394-405","source":"Crossref","is-referenced-by-count":1,"title":["Beyond Knights and Knaves"],"prefix":"10.1007","author":[{"given":"Christine T.","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"McConvey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Drew","family":"Onderko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathaniel","family":"Shar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Tomlinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"34_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ipl.2003.11.013","volume":"89","author":"L. Alonso","year":"2004","unstructured":"Alonso, L., Chassaing, P., Reingold, E.M., Schott, R.: The worst-case chip problem. Information Processing Letters\u00a089(6), 303\u2013308 (2004)","journal-title":"Information Processing Letters"},{"issue":"2","key":"34_CR2","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(2), 313\u2013318 (2002)","journal-title":"Journal of Statistical Planning and Inference"},{"issue":"1","key":"34_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\u201325 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"34_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(5), 253\u2013255 (1993)","journal-title":"Information Processing Letters"},{"key":"34_CR5","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), doi:10.1007\/BF01275672","journal-title":"Combinatorica"},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0012-365X(83)90026-2","volume":"43","author":"P.M. Blecher","year":"1983","unstructured":"Blecher, P.M.: On a logical problem. Discrete Mathematics\u00a043(1), 107\u2013110 (1983)","journal-title":"Discrete Mathematics"},{"issue":"21","key":"34_CR7","doi-asserted-by":"publisher","first-page":"2974","DOI":"10.1016\/j.disc.2010.07.005","volume":"310","author":"M. Wildon","year":"2010","unstructured":"Wildon, M.: Knights, spies, games and ballot sequences. Discrete Mathematics\u00a0310(21), 2974\u20132983 (2010)","journal-title":"Discrete Mathematics"},{"key":"34_CR8","unstructured":"Hanajiri, A.: On knights, knaves, spies and yes-men problems. Master\u2019s thesis, Keio University (2012) (in Japenese). Supervisor: Prof. Oda"},{"key":"34_CR9","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. \u00e9s Fiz. Lapok\u00a048, 436\u2013452 (1941) (in Hungarian)","journal-title":"Mat. \u00e9s Fiz. Lapok"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T01:54:31Z","timestamp":1558662871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}