Patience is a virtue

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	B. Awerbuch: Y. Azar, and S. Plotkin. Throughputcompetitive online routing. In Proceedings of the 33rd Symposium on Foundations of Computer Science, pages 32--40, 1993.
	2	Baruch Awerbuch , Yair Bartal , Amos Fiat , Adi Rosén, Competitive non-preemptive call control, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.312-320, January 23-25, 1994, Arlington, Virginia, United States
	3	Amotz Bar-Noy , Ran Canetti , Shay Kutten , Yishay Mansour , Baruch Schieber, Bandwidth allocation with preemption, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.616-625, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225279]
	4	A. Bar-Noy, J. A. Garay, A. Herzberg, and S. Aggarwal. Sharing video on demand. Manuscript, 1998. Presented at the Workshop on Algorithmic Aspects of Communication, Bologna, Italy, July 1997.
	5	S. Baruah, G. Koren, D. Mao, B. Mishra, A. Ragunathan, L. Rosier, D. Shasta, and F. Wang. On the competitiveness of on-line real-time task scheduling. In Proceedings of t.he Real-Time Systems Symposium, pages 106-115, 1991.
	6	Sanjoy K. Baruah , Jayant R. Haritsa, Scheduling for Overload in Real-Time Systems, IEEE Transactions on Computers, v.46 n.9, p.1034-1039, September 1997 [doi>10.1109/12.620484]
	7	S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in online algorithms. Algorithmica, 11(1):2-14, 1994.
	8	A. Feldmann, B. Maggs, J. Sgall, D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS- 95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1995.
	9	Juan A. Garay , Inder S. Gopal , Shay Kutten , Yishay Mansour , Moti Yung, Efficient on-line call control algorithms, Journal of Algorithms, v.23 n.1, p.180-194, April 1997 [doi>10.1006/jagm.1996.0821]
	10	Sally A. Goldman , Jyoti Parwatikar , Subhash Suri, On-line Scheduling with Hard Deadlines (Extended Abstract), Proceedings of the 5th International Workshop on Algorithms and Data Structures, p.258-271, August 06-08, 1997
	11	R. Graham, E. L. Lawler, J. K. Lenstra, and A. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. In D/screte Optimization II, volume 5 of Annals of Discrete Mathematics, pages 287-326. North Holland, 1979.
	12	B. Kalyanasundaram , Kirk Pruhs, Speed is as powerful as clairvoyance [scheduling problems], Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.214, October 23-25, 1995
	13	A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy paging. Algorithmic.a, 3(1):70-- 119, 1988.
	14	Hermann Kopetz, Real-Time Systems: Design Principles for Distributed Embedded Applications, Kluwer Academic Publishers, Norwell, MA, 1997
	15	E.L. Lawler, J. K. Lenstra, A. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S. Grave#;, A. Rinnooy Kan, and P. Zipken, editors, Logistics of Production and Inventory, volume 4 of Handbooks in Operations Research and Management Science, pages 445-522. North Holland, 1993.
	16	R. Lipton, Online interval scheduling, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.302-311, January 23-25, 1994, Arlington, Virginia, United States
	17	D. Long and M. Thakur. Scheduling realtime disk transfers for continuous media applications. In Proceedings of the l$th IEEE Symposium on Mass Storage Systems, pages 227-232, 1993.
	18	S. A. Plotkin. Competitive routing of virtual circuits in ATM networks. IEEE Journal on Selected Areas in Communication, 13(6):1128-1136, 1995.
	19	P. Raghavan , M. Snir, Memory versus randomization in on-line algorithms, IBM Journal of Research and Development, v.38 n.6, p.683-707, Nov. 1994
	20	Daniel D. Sleator , Robert E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, v.28 n.2, p.202-208, Feb. 1985 [doi>10.1145/2786.2793]