Author:
Albers Susanne,Charikar Moses,Mitzenmacher Michael
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference37 articles.
1. Better bounds for online scheduling;Albers;SIAM J. Comput.,1999
2. A combined BIT and TIMESTAMP algorithm for the list update problem;Albers;Inform, Process. Lett.,1995
3. Alon, N., Kalai, G., Ricklin, M., and Stockmeyer, L.1992, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, inProc. 33rd Ann. Symp. on the Foundations of Computer Science, pp. 334–343.
4. Altman, E., and Nain, P.1992, Closed loop control with delayed information, inProceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Newport, Rhode Island, pp. 193–204, Assoc. Comput. Mach. New York.
5. Altman, E, and, Stidham, S. 1996, Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information, Queueing Systems: Theory and Applications.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献