Unbounded lower bound for k-server against weak adversaries-Reference-Cited by-同舟云学术

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

Unbounded lower bound for k-server against weak adversaries

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bienkowski Marcin¹,Byrka Jarosław¹,Coester Christian²,Jeż Łukasz¹

Affiliation:

1. University of Wrocław, Poland

2. CWI, Netherlands

Funder

Polish National Science Centre

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384306

Reference22 articles.

1. Competitive analysis of randomized paging algorithms

2. A Polylogarithmic-Competitive Algorithm for the k -Server Problem

3. A Primal-Dual Randomized Algorithm for Weighted Paging

4. The ( h,k )-Server Problem on Bounded Depth Trees

5. Nikhil Bansal Marek Eliáš Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018. Tight Bounds for Double Coverage Against Weak Adversaries. Theory of Computing Systems 62 2 ( 2018 ) 349-365. https://doi.org/10.1007/s00224-016-9703-3 10.1007/s00224-016-9703-3 Nikhil Bansal Marek Eliáš Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018. Tight Bounds for Double Coverage Against Weak Adversaries. Theory of Computing Systems 62 2 ( 2018 ) 349-365. https://doi.org/10.1007/s00224-016-9703-3 10.1007/s00224-016-9703-3

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

1. The Randomized -Server Conjecture Is False!;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. The Infinite Server Problem;ACM Transactions on Algorithms;2021-08

3. Managing Multiple Mobile Resources;Theory of Computing Systems;2021-01-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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