Author:
Avin Chen,Salem Iosif,Schmid Stefan
Cited by
5 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. Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications;2022-05-02
4. Formal Modeling and Improvement in the Random Path Routing Network Scheme Using Colored Petri Nets;Applied Sciences;2022-01-28
5. On the Complexity of Traffic Traces and Implications;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2020-05-27