{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:30:58Z","timestamp":1742391058102},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_23","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"271-282","source":"Crossref","is-referenced-by-count":3,"title":["Adaptability and the Usefulness of Hints (Extended Abstract)"],"prefix":"10.1007","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","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"S. Albers, Better bounds for online scheduling. Proc. 29th Annual ACM Symp. on the Theory of Computing, pp. 130\u2013139, El Paso, TX, May 1997.","DOI":"10.1145\/258533.258566"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts. A Theory of Competitive Analysis for Distributed Algorithms. Proc. 33rd IEEE Symp. on the Foundations of Computer Science, pp. 401\u2013411, November 1994.","DOI":"10.1109\/SFCS.1994.365676"},{"key":"23_CR3","unstructured":"Y. Azar, A. Broder and M. Manasse. On-line choice of on-line algorithms. Proc. 4th Annual ACM\/SIAM Symp. on Discrete Algorithms, pp. 432\u2013440, 1993."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"J. Aspnes and O. Waarts. Modular Competitiveness for Distributed Algorithms. Proc. 28th Annual ACM Symp. on the Theory of Computing, pp. 237\u2013246, Philadelphia, PA, May 1996.","DOI":"10.1145\/237814.237869"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, D. Dolev, C. Dwork and H.R. Strong. Shifting gears: changing algorithms on the fly to expedite Byzantine Agreement. Proc. 6th ACM Symposium on the Principles of Distributed Computing, pp. 42\u201351, 1987.","DOI":"10.1145\/41840.41844"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Y. Bartal, A. Fiat, H. Karloff and Y. Rabani, New algorithms for the ancient scheduling problem. Journal of Computer and System Sciences, 51:359\u2013366, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-3422-8_27","volume-title":"Computer Science Research","author":"P. Berman","year":"1992","unstructured":"P. Berman, J. Garay, and K. Perry. Bit Optimal Distributed Consensus. In Computer Science Research (ed. R. Yaeza-Bates and U. Manber), Plenum Publishing Corporation, NY, NY, pp. 313\u2013322, 1992."},{"key":"23_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-56188-9_15","volume-title":"Proc. 6th International Workshop on Distributed Algorithms","author":"P. Berman","year":"1992","unstructured":"P. Berman, J. Garay, and K. Perry. Optimal Early Stopping in Distributed Consensus. Proc. 6th International Workshop on Distributed Algorithms, LNCS (647), Springer-Verlag, pp. 221\u2013237, Haifa, Israel, November 1992."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive Paging with Locality of Reference. Proc. 23rd Annual ACM Symp. on the Theory of Computing, pp. 249\u2013259, New Orleans, Louisiana, May 1991.","DOI":"10.1145\/103418.103422"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"B. Coan and J. Welch, Modular Construction of an Efficient 1-Bit Byzantine Agreement Protocol. Mathematical Systems Theory, special issue on Fault-Tolerant Distributed Algorithms (ed. H.R. Strong), Vol. 26, No. 1 (1993).","DOI":"10.1007\/BF01187076"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"D. Dolev and R. Reischuk, Bounds of Information Exchange for Byzantine Agreement. JACM, Vol. 32, No. 1, pp. 191\u2013204, 1985.","journal-title":"JACM"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"D. Dolev, R. Reischuk and H.R. Strong. Early Stopping in Byzantine Agreement. JACM, Vol. 37, No. 4 (1990), pp. 720\u2013741.","journal-title":"JACM"},{"key":"23_CR13","first-page":"107","volume":"9","author":"U. Faigle","year":"1989","unstructured":"U. Faigle, W. Kern and G. Turan, On the performance of online algorithms for particular problems. Acta Cybernetica, 9:107\u2013119, 1989.","journal-title":"Acta Cybernetica"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. J. Fischer","year":"1982","unstructured":"M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Proc. Letters, 14 (1982), pp. 183\u2013186.","journal-title":"Inf. Proc. Letters"},{"key":"23_CR15","first-page":"263","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17:263\u2013269, 1969.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"V. Hadzilacos and J. Halpern. Message-Optimal Protocols for Byzantine Agreement. Proc. 10th Annual ACM Symp. on the Principles of Distributed Computing, pp. 309\u2013324, Montreal, Canada, August 1991.","DOI":"10.1145\/112600.112626"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D.R. Karger","year":"1996","unstructured":"D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, Journal of ALgorithms, 20:400\u2013430, 1996.","journal-title":"Journal of ALgorithms"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):70\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"A. Karlin, S. Phillips, and P. Raghavan. Markov Paging. Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 208\u2013217, 1992.","DOI":"10.1109\/SFCS.1992.267771"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R.E. Shostak and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems, 4:3 (1982), pp. 382\u2013401.","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"23_CR21","first-page":"652","volume":"32","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32:652\u2013686, 1985.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:28:22Z","timestamp":1556958502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}