Author:
Berman Piotr,Garay Juan A.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
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.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献