Storage and search in dynamic peer-to-peer networks-Reference-Cited by-同舟云学术

Storage and search in dynamic peer-to-peer networks

Published:2013-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
language:
Short-container-title:

Author:

Augustine John¹,Molla Anisur Rahaman²,Morsy Ehab³,Pandurangan Gopal²,Robinson Peter²,Upfal Eli⁴

Affiliation:

1. Indian Institute of Technology Madras, Chennai, India

2. Nanyang Technological University, Singapore, Singapore

3. Suez Canal University, Ismailia, Egypt

4. Brown University, Providence, RI, USA

Publisher

ACM

Link

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

Reference49 articles.

1. John Augustine Anisur Rahaman Molla Ehab Morsy Gopal Pandurangan Peter Robinson and Eli Upfal. Storage and search in dynamic peer-to-peer networks. CoRR abs/1305.1121 2013. 10.1145/2486159.2486170 John Augustine Anisur Rahaman Molla Ehab Morsy Gopal Pandurangan Peter Robinson and Eli Upfal. Storage and search in dynamic peer-to-peer networks. CoRR abs/1305.1121 2013. 10.1145/2486159.2486170

2. How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

3. Towards a Scalable and Robust DHT

4. Design and implementation of a P2P Cloud system

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

1. DeScan: Censorship-resistant indexing and search for Web3;Future Generation Computer Systems;2024-03

2. Online Multi-Agent Decentralized Byzantine-robust Gradient Estimation;ACM SIGMETRICS Performance Evaluation Review;2023-04-26

3. A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

4. Finding Subgraphs in Highly Dynamic Networks;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

5. Resource Burning for Permissionless Systems (Invited Paper);Structural Information and Communication Complexity;2020