Author:
Augustine John,Pandurangan Gopal,Robinson Peter
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
2. 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
3. Byzantine-Resilient Counting in Networks;2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS);2022-07
4. Sublinear Algorithms in T-interval Dynamic Networks;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
5. Resource Burning for Permissionless Systems (Invited Paper);Structural Information and Communication Complexity;2020