{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:36:33Z","timestamp":1742924193359,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_12","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"167-181","source":"Crossref","is-referenced-by-count":2,"title":["Constant-Space Localized Byzantine Consensus"],"prefix":"10.1007","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ezra N.","family":"Hoch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/jagm.1996.0852","volume":"25","author":"Y. Afek","year":"1997","unstructured":"Afek, Y., Stupp, G.: Optimal time-space tradeoff for shared memory leader election. J. Algorithms\u00a025(1), 95\u2013117 (1997)","journal-title":"J. Algorithms"},{"key":"12_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Chichester (2004)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/301308.301358","volume-title":"PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing","author":"J. Beauquier","year":"1999","unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 199\u2013207. ACM, New York (1999)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-007-0034-0","volume":"20","author":"J. Beauquier","year":"2007","unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing\u00a020(1), 75\u201393 (2007)","journal-title":"Distributed Computing"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst.\u00a020(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"12_CR6","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a03, 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM\u00a032(1), 191\u2013204 (1985)","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/248052.248055","volume-title":"PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing","author":"S. Dolev","year":"1996","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. In: PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 27\u201334. ACM, New York (1996)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/1011767.1011807","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"C.-Y. Koo","year":"2004","unstructured":"Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 275\u2013282. ACM, New York (2004)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 301\u2013382 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR12","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A. Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett.\u00a093(3), 109\u2013115 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"Toueg, S., Perry, K.J., Srikanth, T.K.: Fast distributed agreement. SIAM Journal on Computing\u00a016(3), 445\u2013457 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. i. characterizing the solvable cases. Parallel and Distributed Systems, IEEE Transactions\u00a07(1), 69\u201389 (1996)","journal-title":"Parallel and Distributed Systems, IEEE Transactions"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:06:07Z","timestamp":1714795567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}