10 citations · 25 across the 7 of their papers we have counts for
7 papers
A Survey of Blockchain, Artificial Intelligence, and Edge Computing for Web 3.0
Jianjun Zhu, Fan Li, Jinyuan Chen
Web 3.0, as the third generation of the World Wide Web, aims to solve contemporary problems of trust, centralization, and data ownership. Driven by the latest advances in cutting-e…
Solving Nonsmooth Resource Allocation Problems with Feasibility Constraints through Novel Distributed Algorithms
Xiaohong Nian, Fan Li, Dongxin Liu
The distributed non-smooth resource allocation problem over multi-agent networks is studied in this paper, where each agent is subject to globally coupled network resource constrai…
Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks
Fan Li, Jinyuan Chen
In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is…
Adding a Helper Can Totally Remove the Secrecy Constraints in Interference Channel
Jinyuan Chen, Fan Li
In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this work we show an interesting obser…
Wireless MapReduce Distributed Computing
Fan Li, Jinyuan Chen, Zhiying Wang
Motivated by mobile edge computing and wireless data centers, we study a wireless distributed computing framework where the distributed nodes exchange information over a wireless i…
Distributed Computing with Heterogeneous Communication Constraints: The Worst-Case Computation Load and Proof by Contradiction
Nishant Shakya, Fan Li, Jinyuan Chen
We consider a distributed computing framework where the distributed nodes have different communication capabilities, motivated by the heterogeneous networks in data centers and mob…
A better tester for bipartiteness?
Andrej Bogdanov, Fan Li
Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is ε-far from bipartite, then the subgraph induced by a random subset of O(1/ε) vertices is…