Funder
Grantová Agentura Ceské Republiky (CZ)
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1–2), 203–218 (2000). doi:
10.1016/S0304-3975(98)00116-9
. (A preliminary version appeared at ESA 1996)
2. Adamaszek, A., Czumaj, A., Englert, M., Räcke, H.: An O(log k)-competitive algorithm for generalized caching. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1681–1689 (2012). doi:
10.1137/1.9781611973099
3. Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 31–40 (1999).
http://dl.acm.org/citation.cfm?id=314500.314528
4. Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: A mazing
$$2+\epsilon $$
2
+
ϵ
approximation for unsplittable flow on a path. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5–7, 2014, pp. 26–41. SIAM (2014). doi:
10.1137/1.9781611973402.3
5. Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. SIAM J. Comput. 41(2), 391–414 (2012). doi:
10.1137/090779000
. (A preliminary version appeared at STOC 2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Making Cache Monotonic and Consistent;Proceedings of the VLDB Endowment;2022-12
2. Competitive Consistent Caching for Transactions;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
3. Practical Bounds on Optimal Caching with Variable Object Sizes;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2018-06-13