{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:06Z","timestamp":1725664026580},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:56:13Z","timestamp":1330235773000},"page":"136-152","source":"Crossref","is-referenced-by-count":0,"title":["Optimal time Byzantine agreement for t < n\/8 with linear messages"],"prefix":"10.1007","author":[{"given":"Arkady","family":"Zamsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Israeli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomit S.","family":"Pinter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"10_CR1","first-page":"380","volume":"3","author":"A. Bar-Noy","year":"1988","unstructured":"Bar-Noy, A., Dolev, D.: Families of Consensus Algorithms. Proc. Aegean Workshop on Computing 3 (1988) 380\u2013390","journal-title":"Proc. Aegean Workshop on Computing"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/41840.41844","volume":"6","author":"A. Bar-Noy","year":"1987","unstructured":"Bar-Noy, A., Dolev, D., Dwork, C, Strong, H.R.: Shifting Gears to Expedite Byzantine Agreement. Proc. Annual ACM Symposium on Principles of Distributed Computing 6 (1987) 42\u201351","journal-title":"Proc. Annual ACM Symposium on Principles of Distributed Computing"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.: Optimal Early Stopping in Distributed Consensus. IBM Research Report RC 16746 (1990)","DOI":"10.1109\/SFCS.1989.63511"},{"key":"10_CR4","unstructured":"Berman, P, Garay, J.: Distributed Consensus with n = 3 \u00b7 (t + \u03b5) Processors. Proc. International Workshop on Distributed Algorithms, LNCS, Springer-Verlag 5 (1991)"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/SFCS.1989.63511","volume":"30","author":"P. Berman","year":"1989","unstructured":"Berman, P., Garay, J., Perry, K.J.: Towards Optimal Distributed Consensus. Proc. Symposium on Foundation of Computer Science 30 (1989) 410\u2013415","journal-title":"Proc. Symposium on Foundation of Computer Science"},{"key":"10_CR6","first-page":"663","volume":"26","author":"B. Coan","year":"1988","unstructured":"Coan, B.: Efficient Agreement using Fault Diagnosis. Proc. Allerton Conference on Communication, Control and Computing 26 (1988) 663\u2013672","journal-title":"Proc. Allerton Conference on Communication, Control and Computing"},{"key":"10_CR7","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. JACM 32 1985 191\u2013204","journal-title":"JACM"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early Stopping in Byzantine Agreement. JACM 37 (1990) 720\u2013741","journal-title":"JACM"},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. Fisher","year":"1982","unstructured":"Fisher, M., Lynch, N.: A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters 14:4 (1982) 183\u2013186","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/112600.112626","volume":"10","author":"V. Hadzilacos","year":"1991","unstructured":"Hadzilacos, V., Halpern, J.: Message-Optimal Protocols for Byzantine Agreement. Proc. Annual ACM Symposium on Principles of Distributed Computing 10 (1991) 309\u2013324","journal-title":"Proc. Annual ACM Symposium on Principles of Distributed Computing"},{"key":"10_CR11","first-page":"246","volume":"29","author":"Y. Moses","year":"1988","unstructured":"Moses, Y., Waarts, O.: Coordinated Traversal: t+1-Round Byzantine Agreement in Polinomial Time. Proc. Symposium on Foundation of Computer Science 29 (1988) 246\u2013255","journal-title":"Proc. Symposium on Foundation of Computer Science"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"228","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. JACM 27:2 (1980) 228\u2013234","journal-title":"JACM"},{"key":"10_CR13","volume-title":"M.Sc. Thesis","author":"O. Waarts","year":"1988","unstructured":"Waarts, O.: Coordinated Traversal: Byzantine Agreement in Polynomial Time. M.Sc. Thesis, Weizmann Institute of Science, Rehovot, Israel (1988)"},{"key":"10_CR14","volume-title":"M.Sc. Thesis, (in Hebrew)","author":"A. Zamsky","year":"1992","unstructured":"Zamsky, A.: New Algorithms for Agreement Problem in Synchronous Distributed Networks. M.Sc. Thesis, (in Hebrew), Technion, Haifa, Israel (1992)"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:49Z","timestamp":1605628969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}