{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:33:38Z","timestamp":1763415218810,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040405","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"380-390","source":"Crossref","is-referenced-by-count":10,"title":["Families of consensus algorithms"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong, \u201cShifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement,\u201d proceedings, the 6th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Aug. 87, pp. 42\u201351.","DOI":"10.1145\/41840.41844"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"B. A. Coan, \u201cA Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols,\u201d Proceedings, the 5th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Aug. 1986.","DOI":"10.1145\/10590.10596"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"R. DeMillo, N. A. Lynch, and M. Merritt, \u201cCryptographic Protocols,\u201d Proceedings, the 14th Annual ACM Symposium on Theory of Computing, pp. 383\u2013400, 1982.","DOI":"10.1145\/800070.802214"},{"key":"38_CR4","unstructured":"D. Dolev, R. Reischuk, and H. R. Strong, \u201cEarly Stopping in Byzantine Agreement,\u201d IBM Research Report RJ5406 (55357), 1986."},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"D. Dolev, and H. R. Strong, \u201cAuthenticated Algorithms for Byzantine Agreement,\u201d Siam Journal on Computing, Vol. 12, pp. 656\u2013666, 1983.","journal-title":"Siam Journal on Computing"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"M. Pease, R. Shostak, and L. Lamport, \u201cReaching Agreement in the Presence of Faults,\u201d JACM, Vol. 27, 1980.","DOI":"10.1145\/322186.322188"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040405.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:16:41Z","timestamp":1736500601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0040405","relation":{},"subject":[]}}