{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:24Z","timestamp":1725563484428},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_18","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"194-197","source":"Crossref","is-referenced-by-count":7,"title":["Brief Announcement: Simple Gradecast Based Algorithms"],"prefix":"10.1007","author":[{"given":"Michael","family":"Ben-Or","sequence":"first","affiliation":[]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[]},{"given":"Ezra N.","family":"Hoch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Dolev, D., Hoch, E.N.: Simple gradecast based algorithms. CoRR, abs\/1007.1049 (2010)","DOI":"10.1007\/978-3-642-15763-9_18"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Stark, E., Weihl, W.E., Pinter, S.: Reaching approximate agreement in the presence of faults. J. of the ACM\u00a033, 499\u2013516 (1986)","journal-title":"J. of the ACM"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/10590.10597","volume-title":"PODC \u201986","author":"A.D. Fekete","year":"1986","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. In: PODC \u201986, pp. 73\u201387. ACM, New York (1986)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/62212.62225","volume-title":"STOC \u201988","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: STOC \u201988, pp. 148\u2013161. ACM, New York (1988)"},{"key":"18_CR5","unstructured":"Zamsky, A.: Phd thesis (October 1998)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:42Z","timestamp":1606185582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}