{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:11Z","timestamp":1725663851365},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:10:28Z","timestamp":1330240228000},"page":"463-472","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of finding replicas using equality tests"],"prefix":"10.1007","author":[{"given":"Gudmund Skovbjerg","family":"Frandsen","sequence":"first","affiliation":[]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Skyum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Extremal Graph Theory. Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1093\/comjnl\/34.2.186","volume":"34","author":"D. Campbell","year":"1991","unstructured":"Campbell, D. and McNeill, T., Finding a majority when sorting is not available. The Computer Journal 34 (1991) 186.","journal-title":"The Computer Journal"},{"key":"38_CR3","first-page":"376","volume":"3","author":"M. J. Fischer","year":"1982","unstructured":"Fischer, M. J. and Salzburg S. L., Solution to problem 81-5. Journal of Algorithms 3 (1982) 376\u2013379.","journal-title":"Journal of Algorithms"},{"key":"38_CR4","volume-title":"Manuscript","author":"D. W. Matula","year":"1990","unstructured":"Matula, D. W., An Optimal Algorithm for the Majority Problem. Manuscript, Southern Methodist University, Texas, 1990."},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J. and Gries, D., Finding Repeated Elements. Science of Computer Programming 2 (1982) 143\u2013152.","journal-title":"Science of Computer Programming"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(81)90022-5","volume":"2","author":"J. Moore","year":"1981","unstructured":"Moore, J., Problem 81-5. Journal of Algorithms 2 (1981) 208\u2013209.","journal-title":"Journal of Algorithms"},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01275672","volume":"11","author":"M. E. Saks","year":"1991","unstructured":"Saks, M. E. and Werman, M., On Computing Majority by Comparisons. Combinatorica 11 (1991) 383\u2013387.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:08:40Z","timestamp":1605629320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}