Competitive Algorithms for Restricted Caching and Matroid Caching-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Competitive Algorithms for Restricted Caching and Matroid Caching

Published:2014 Issue: Volume: Page:209-221
ISSN:0302-9743
Container-title:Algorithms - ESA 2014
language:
Short-container-title:

Author:

Buchbinder Niv,Chen Shahar,Naor Joseph

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44777-2_18

Reference26 articles.

1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoretical Computer Science 234, 203–218 (2000)

2. Adamaszek, A., Czumaj, A., Englert, M., Räcke, H.: An o(log k)-competitive algorithm for generalized caching. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1681–1689 (2012)

3. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM Journal on Computing 39(2), 361–370 (2009)

4. Bansal, N., Buchbinder, N., Naor, J.: Towards the randomized k-server conjecture: A primal-dual approach. In: Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 40–55 (2010)

5. Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. J. ACM 59(4) (2012)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Associativity Threshold Phenomenon in Set-Associative Caches;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

2. Paging and the Address-Translation Problem;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

3. Online Tree Caching;Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures;2017-07-24

4. Unified Algorithms for Online Learning and Competitive Analysis;Mathematics of Operations Research;2016-05

5. Online Balanced Repartitioning;Lecture Notes in Computer Science;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3