{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:29Z","timestamp":1725558509661},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_31","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"368-377","source":"Crossref","is-referenced-by-count":4,"title":["Randomized Algorithms for Determining the Majority on Graphs"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Aigner, M.: Variants of the majority problem. Discrete Applied Mathematics (to appear)","key":"31_CR1","DOI":"10.1016\/S0166-218X(03)00186-0"},{"key":"31_CR2","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, 253\u2013255 (1993)","journal-title":"Information Processing Letters"},{"key":"31_CR3","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 Journal on Computing\u00a026, 1\u201314 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/S0019-9958(81)90388-0","volume":"49","author":"K.Y. Chwa","year":"1981","unstructured":"Chwa, K.Y., Hakimi, S.L.: Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems. Information and Control\u00a049, 212\u2013238 (1981)","journal-title":"Information and Control"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1137\/S0097539794268765","volume":"27","author":"D. Gillman","year":"1998","unstructured":"Gillman, D.: A Chernoff bound for random walks on expander graphs. SIAM Journal on Computing\u00a027, 1203\u20131220 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989","unstructured":"Hagerup, T., Rub, C.: A guided tour of Chernoff bounds. Information Processing Letters\u00a033, 305\u2013308 (1989\/90)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proc. 14th ACM Symposium on Principles of Distributed Computing, pp. 20\u201327 (1995)","key":"31_CR7","DOI":"10.1145\/224964.224967"},{"doi-asserted-by":"crossref","unstructured":"Malek, M.: A comparison connection assignment for diagnosis of multiprocessor systems. In: Proc. 7th Symp. Comput. Architecture, pp. 31\u201335 (1980)","key":"31_CR8","DOI":"10.1145\/800053.801906"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"F.P. Preparata","year":"1967","unstructured":"Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Trans. on Electr. Computers\u00a016, 848\u2013854 (1967)","journal-title":"IEEE Trans. on Electr. Computers"},{"key":"31_CR10","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)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science, pp. 222\u2013227 (1977)","key":"31_CR11","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:53:40Z","timestamp":1559195620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}