{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:35:07Z","timestamp":1691598907351},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02280836","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:11:08Z","timestamp":1138201868000},"page":"67-73","source":"Crossref","is-referenced-by-count":8,"title":["Fast consensus in networks of bounded degree"],"prefix":"10.1007","volume":"7","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02280836_CR1","series-title":"London Math Society","first-page":"80","volume-title":"Random Graphs. Combinatorics","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s B: Random Graphs. Combinatorics. London Math Society LN52, Cambridge University Press. London 1981, pp 80\u2013102"},{"key":"BF02280836_CR2","series-title":"Lecture Notes Comput Sci","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Proc 16th Int Colloquium on Automata, Languages and Programming","author":"P Berman","year":"1989","unstructured":"Berman P, Garay J: Asymptotically optimal distributed consensus. Proc 16th Int Colloquium on Automata, Languages and Programming. Lecture Notes Comput Sci, vol 372. Springer, Berlin Heidelberg New York 1989, pp:80\u201394"},{"key":"BF02280836_CR3","series-title":"Proc 30th Symp on Foundations of Computer Science","first-page":"410","volume-title":"Towards Optimal Distributed Consensus","author":"P Berman","year":"1989","unstructured":"Berman P, Garay J, Perry K: Towards Optimal Distributed Consensus. Proc 30th Symp on Foundations of Computer Science, October 1989. IEEE Computer Society Press, Los Alamitos, pp 410\u2013415"},{"key":"BF02280836_CR4","series-title":"COMPUTER SCIENCE, Research and Applications","volume-title":"Penn State University Tech Rep CS-89-24, August 1989. Revised version: Bit optimal distributed consensus","author":"P Berman","year":"1992","unstructured":"Berman P, Garay J, Perry K: Recursive phase king protocols for distributed consensus. Penn State University Tech Rep CS-89-24, August 1989. Revised version: Bit optimal distributed consensus. In: Manber U, Yaeza-Bates R (eds) COMPUTER SCIENCE, Research and Applications. Plenum Press, New York 1992"},{"key":"BF02280836_CR5","series-title":"Proc 15th Int Symp on Fault-Tolerant Computing","first-page":"200","volume-title":"Atomic broadcast: from simple message diffusion to Byzantine agreement","author":"F Cristian","year":"1985","unstructured":"Cristian F, Aghili H, Strong R, Dolev D: Atomic broadcast: from simple message diffusion to Byzantine agreement. Proc 15th Int Symp on Fault-Tolerant Computing, June 1985. IEEE Computer Society Press, Los Alamitos, pp 200\u2013206. Revised version in IBM research report RJ5244"},{"key":"BF02280836_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"B Coan","year":"1992","unstructured":"Coan B, Welch J: Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Inf Comput 97: 61\u201385 (1992)","journal-title":"Inf Comput"},{"key":"BF02280836_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev D: The Byzantine generals strike again. J Algorithms 3: 14\u201330 (1982)","journal-title":"J Algorithms"},{"key":"BF02280836_CR8","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C Dwork","year":"1988","unstructured":"Dwork C, Peleg D, Pippenger N, Upfal E: Fault tolerance in networks of bounded degree. SIAM J Comput 17: 975\u2013988 (1988)","journal-title":"SIAM J Comput"},{"key":"BF02280836_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev D, Reischuk, R: Bounds of information exchange for Byzantine agreement. J ACM 32: 191\u2013204 (1985)","journal-title":"J ACM"},{"key":"BF02280836_CR10","doi-asserted-by":"crossref","unstructured":"Dolev D, Strong HR: Polynomial algorithms for multiple processor agreement. Proc 14th Symp on Theory of Computing, May 1982. ACM Press, New York, pp 401\u2013407","DOI":"10.1145\/800070.802215"},{"key":"BF02280836_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L: Reaching agreement in the presence of faults. J ACM 27: 121\u2013169 (1980)","journal-title":"J ACM"},{"key":"BF02280836_CR12","series-title":"Proc 26th Symp on Foundations of Computer Science","first-page":"31","volume-title":"On networks of noisy gates","author":"N Pippenger","year":"1985","unstructured":"Pippenger N: On networks of noisy gates. Proc 26th Symp on Foundations of Computer Science. October 1985. IEEE Computer Society Press, Los Alamitos, pp 31\u201338"},{"key":"BF02280836_CR13","volume-title":"Computational aspects of VLSI","author":"JD Ullman","year":"1984","unstructured":"Ullman JD: Computational aspects of VLSI. Computer Science Press, New York 1984"},{"key":"BF02280836_CR14","series-title":"Proc 11th ACM Symp on Principles of Distributed Computing","first-page":"83","volume-title":"Tolerating linear number of faults in networks of bounded degree","author":"E Upfal","year":"1992","unstructured":"Upfal E: Tolerating linear number of faults in networks of bounded degree. Proc 11th ACM Symp on Principles of Distributed Computing. ACM Press, New York, pp 83\u201390, 1992"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02280836\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:53:45Z","timestamp":1558025625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02280836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02280836"],"URL":"https:\/\/doi.org\/10.1007\/bf02280836","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}