Deterministic Self-Adjusting Tree Networks Using Rotor Walks

Author:

Avin Chen1,Bienkowski Marcin2,Salem Iosif3,Sama Robert4,Schmid Stefan5,Schmidt Pawel2

Affiliation:

1. Ben Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel

2. University of Wroclaw,Institute of Computer Science,Wroclaw,Poland

3. TU Berlin,Dept. of Telecommunication Systems,Berlin,Germany

4. University of Vienna,Faculty of Computer Science,Vienna,Austria

5. TU Berlin, Germany & University of Vienna, Austria,Department of Telecommunication Systems,Berlin,Germany

Funder

European Research Council

Publisher

IEEE

Reference31 articles.

1. Distributed covering by ant-robots using evaporating traces

2. Self-adjusting binary search trees

3. Demand-aware network designs of bounded degree;avin;Proc International Symposium on Distributed Computing (DISC),2017

4. Push-down trees: Optimal self-adjusting complete trees;avin;CoRR,2018

5. Dynamically Optimal Self-adjusting Single-Source Tree Networks

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

1. Toward Self-Adjusting $k$-Ary Search Tree Networks;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

2. SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17

3. Self-adjusting Linear Networks with Ladder Demand Graph;Structural Information and Communication Complexity;2023

4. Deterministic Self-Adjusting Tree Networks Using Rotor Walks;2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS);2022-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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