Adaptability and the usefulness of hints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 271-282

  Berman, Piotr ^a   Garay, Juan A ^b  

^a The Center for Nanotechnology Education and Utilization   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPETITIVE ANALYSIS; CONSENSUS ALGORITHMS; DISTRIBUTED CONSENSUS; EARLY STOPPING; IDENTICAL PROCESSORS; INFORMATION CONCERNING; ONLINE SCHEDULING; PARALLEL AND DISTRIBUTED ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84896784367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_23     Document Type: Conference Paper

References (21)

1. S. Albers, Better bounds for online scheduling. Proc. 29th Annual ACM Symp. on the Theory of Computing, pp. 130-139, El Paso, TX, May 1997.
2. 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-411, November 1994.
3. 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-440, 1993.
4. J. Aspnes and O. Waarts. Modular Competitiveness for Distributed Algorithms. Proc. 28th Annual ACM Symp. on the Theory of Computing, pp. 237-246, Philadelphia, PA, May 1996.
5. 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-51, 1987.
6. Y. Bartal, A. Fiat, H. Karloff and Y. Rabani, New algorithms for the ancient scheduling problem. Journal of Computer and System Sciences, 51: 359-366, 1995.
7. 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-322, 1992.
8. 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-237, Haifa, Israel, November 1992.
9. 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-259, New Orleans, Louisiana, May 1991.
10. 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).
11. D. Dolev and R. Reischuk, Bounds of Information Exchange for Byzantine Agreement. JACM, Vol. 32, No. 1, pp. 191-204, 1985.
12. D. Dolev, R. Reischuk and H.R. Strong. Early Stopping in Byzantine Agreement. JACM, Vol. 37, No. 4 (1990), pp. 720-741.
13. U. Faigle, W. Kern and G. Turan, On the performance of online algorithms for particular problems. Acta Cybernetica, 9: 107-119, 1989.
14. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Proc. Letters, 14 (1982), pp. 183-186.
15. R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17: 263-269, 1969.
16. V. Hadzilacos and J. Halpern. Message-Optimal Protocols for Byzantine Agreement. Proc. 10th Annual ACM Symp. on the Principles of Distributed Computing, pp. 309-324, Montreal, Canada, August 1991.
17. D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, Journal of ALgorithms, 20: 400-430, 1996.
18. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1): 70-119, 1988.
19. A. Karlin, S. Phillips, and P. Raghavan. Markov Paging. Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 208-217, 1992.
20. L. Lamport, R.E. Shostak and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems, 4: 3 (1982), pp. 382-401.
21. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32: 652-686, 1985.