Author:
Bansal Nikhil,Buchbinder Niv,Naor Joseph
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theory Computer Science 234(1-2), 203–218 (2000)
2. Bansal, N., Buchbinder, N., Naor, J.S.: A primal-dual randomized algorithm for weighted paging. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 507–517 (2007)
3. Bansal, N., Buchbinder, N., Naor, S.: Towards the randomized k-server conjecture: A primal-dual approach. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 (to appear, 2010)
4. Bansal, N., Buchbinder, N., Naor, J.(S).: Randomized competitive algorithms for generalized caching. In: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 235–244 (2008)
5. Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog(n)-competitive algorithm for metrical task systems. In: Proceedings of the 29th Annual ACM Symposium on Theory of computing, pp. 711–719 (1997)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chasing Positive Bodies;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Pure Entropic Regularization for Metrical Task Systems;Theory of Computing;2022
3. Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing;SIAM Journal on Computing;2021-01
4. Online optimization with look-ahead for freeway emergency vehicle dispatching considering availability;Transportation Research Part C: Emerging Technologies;2019-12
5. Fusible HSTs and the Randomized k-Server Conjecture;2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS);2018-10