{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T16:33:46Z","timestamp":1693845226445},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0020-0190(94)00064-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"1-6","source":"Crossref","is-referenced-by-count":15,"title":["Optimal coteries and voting schemes"],"prefix":"10.1016","volume":"51","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(94)00064-6_BIB1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TR.1986.4335422","article-title":"Computational complexity of network reliability analysis: An overview","volume":"35","author":"Ball","year":"1986","journal-title":"IEEE Trans. Reliability"},{"issue":"3","key":"10.1016\/0020-0190(94)00064-6_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/6420.6421","article-title":"The vulnerability of vote assignments","volume":"4","author":"Barbara","year":"1986","journal-title":"ACM Trans. Comput. Systems"},{"issue":"10","key":"10.1016\/0020-0190(94)00064-6_BIB3","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/TC.1987.1676860","article-title":"The reliability of voting mechanisms","volume":"36","author":"Barbara","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0190(94)00064-6_BIB4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/75104.75107","article-title":"Increasing availability under mutual exclusion constraints with dynamic vote reassignment","volume":"7","author":"Barbara","year":"1989","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0020-0190(94)00064-6_BIB5","series-title":"Combinatorics: Set Systems, Hypergraphs, Families and Vectors, and Combinatorial Probability","author":"Bollob\u00e1s","year":"1986"},{"issue":"4","key":"10.1016\/0020-0190(94)00064-6_BIB6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","article-title":"How to assign votes in distributed system","volume":"32","author":"Garcia-Mollina","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00064-6_BIB7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/SPDP.1991.218285","article-title":"Boolean Theory of Coteries","author":"Ibaraki","year":"1991","journal-title":"Proc. IEEE Symp. on Parallel and Distributed Processing"},{"key":"10.1016\/0020-0190(94)00064-6_BIB8","first-page":"650","article-title":"Optimal coteries for rings and related networks","author":"Ibaraki","year":"1992","journal-title":"Proc. Internat. Conf. on Distributed Computing Systems"},{"issue":"5","key":"10.1016\/0020-0190(94)00064-6_BIB9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/12.223674","article-title":"Availability of k-coterie","volume":"42","author":"Kakugawa","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)00064-6_BIB10","author":"Papadimitriou","year":"1993","journal-title":"Personal communication"},{"key":"10.1016\/0020-0190(94)00064-6_BIB11","first-page":"75","article-title":"Optimal Coteries","author":"Papadimitriou","year":"1991","journal-title":"Proc. Conf. on the Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(94)00064-6_BIB12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.262589","article-title":"Voting as the optimal static pessimistic scheme for managing replicated data","volume":"1","author":"Spasojevic","year":"1994","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/0020-0190(94)00064-6_BIB13","article-title":"The complexity of reliability","volume":"12","author":"Valiant","year":"1981","journal-title":"SICOMP"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:18Z","timestamp":1555132938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0020019094000646"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00064-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}