Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SRF: Random Expanders for Designing Scalable Robust and Fast Communication Networks;IEEE Transactions on Circuits and Systems II: Express Briefs;2022-12
2. An Upper Bound for Sorting $$R_n$$ with LRE;Communications in Computer and Information Science;2021
3. Small-World Regular Networks for Communication;IEEE Transactions on Circuits and Systems II: Express Briefs;2020-08
4. Exact upper bound for sorting Rn with LE;Discrete Mathematics, Algorithms and Applications;2020-05-04
5. An Upper Bound for Sorting $$R_n$$ with LE;Communications in Computer and Information Science;2019