{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:08Z","timestamp":1725663308010},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:28:25Z","timestamp":1330208905000},"page":"304-320","source":"Crossref","is-referenced-by-count":3,"title":["Early-stopping distributed bidding and applications"],"prefix":"10.1007","author":[{"given":"Navin","family":"Budhiraja","sequence":"first","affiliation":[]},{"given":"Ajei","family":"Gopal","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Brian A. Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. The distributed firing squad problem. In Proceedings of the Seventeenth ACM Symposium on Theory of Computing, pages 335\u2013345, Providence, Rhode Island, May 1985. ACM SIGACT.","DOI":"10.1145\/22145.22182"},{"key":"21_CR2","unstructured":"Brian A. Coan. Efficient agreement using fault diagnosis. In Proceedings of the Twenty-Sixth Annual Allerton Conference on Communication, Control, and Computing, September 1988."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01784024","volume":"3","author":"F. Cristian","year":"1989","unstructured":"Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146\u2013158, 1989.","journal-title":"Distributed Computing"},{"key":"21_CR4","unstructured":"Flaviu Cristian and Ray Strong. A family of early-delivery atomic broadcast protocols, June 1987. IBM Almaden Research Center, Unpublished manuscript."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Danny Dolev, R. Reischuk, and Ray Strong. Eventual is earlier than immediate. In Proceedings of Twenty third Symposium on Foundations of Computer Science, pages 196\u2013203, November 1982.","DOI":"10.1109\/SFCS.1982.51"},{"issue":"4","key":"21_CR6","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Danny Dolev and H. Ray Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656\u2013666, November 1983.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Ajei Gopal, Ray Strong, Sam Toueg, and Flaviu Cristian. Early-delivery atomic broadcast. In Proceedings of Ninth ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, August 1990.","DOI":"10.1145\/93385.93430"},{"key":"21_CR8","unstructured":"Amir Herzberg and Shay Kutten. Efficient detection of message forwarding faults. In Proceedings of the Eight ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, August 1989. ACM SIGOPS-SIGACT."},{"issue":"3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Leslie Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR10","first-page":"246","volume-title":"Proceedings of the Twenty-Ninth IEEE Symposium on Foundations of Computer Science","author":"Y. Moses","year":"1988","unstructured":"Yoram Moses and Orly Waarts. Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time. In Proceedings of the Twenty-Ninth IEEE Symposium on Foundations of Computer Science, pages 246\u2013255, White Plains, New York, October 1988. IEEE."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed systems. In Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, pages 248\u2013262, Toronto, Ontario, August 1988. ACM SIGOPS-SIGACT.","DOI":"10.1145\/62546.62588"},{"key":"21_CR12","series-title":"Technical Report","volume-title":"An authenticated byzantine generals algorithm with early stopping","author":"K. J. Perry","year":"1984","unstructured":"Kenneth J. Perry and Sam Toueg. An authenticated byzantine generals algorithm with early stopping. Technical Report 84-620, Cornell University, Ithaca, June 1984."},{"issue":"3","key":"21_CR13","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K. J. Perry","year":"1986","unstructured":"Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477\u2013482, March 1986.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Fred Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 1990. To Appear.","DOI":"10.1145\/98163.98167"},{"issue":"2","key":"21_CR15","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T. K. Srikanth","year":"1987","unstructured":"T. K. Srikanth and Sam Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80\u201394, 1987.","journal-title":"Distributed Computing"},{"issue":"3","key":"21_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"Sam Toueg, Kenneth J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445\u2013457, June 1987.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:20Z","timestamp":1605646340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}