{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:51Z","timestamp":1759063671319},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01275672","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T08:07:14Z","timestamp":1111651634000},"page":"383-387","source":"Crossref","is-referenced-by-count":55,"title":["On computing majority by comparisons"],"prefix":"10.1007","volume":"11","author":[{"given":"Michael E.","family":"Saks","sequence":"first","affiliation":[]},{"given":"Michael","family":"Werman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. R. Best, P. van Emde Boas, andH. W. Lenstra,Jr.: A sharpened version of the Anaderaa-Rosenberg conjecture,Math. Centrum, Amsterdam 1974."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s:Extremal Graph Theory, Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"CR3","first-page":"375","volume":"3","author":"M. J. Fisher","year":"1982","unstructured":"M. J. Fisher, andS. L. Salzberg: Finding a majority amongn voters,Journal of Algorithms,3 (1982), 375?379.","journal-title":"Journal of Algorithms"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"J. Misra, andD. Gries: Finding repeated elements,Science of Computer Programming,2 (1982), 143?152.","journal-title":"Science of Computer Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R. Rivest","year":"1976\/77","unstructured":"R. Rivest, andJ. Viullemin: On recognizing graph properties from adjacency matrices.Theor. Comp. Sci. 3 (1976\/77), 371?384.","journal-title":"Theor. Comp. Sci."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275672.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01275672\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:02:28Z","timestamp":1586178148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01275672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01275672"],"URL":"https:\/\/doi.org\/10.1007\/bf01275672","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}