Fan Li

Orcid: 0000-0001-9391-997X

Affiliations:
  • Louisiana Tech University, Department of Electrical Engineering, Ruston, LA, USA


According to our database1, Fan Li authored at least 12 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Survey of Blockchain, Artificial Intelligence, and Edge Computing for Web 3.0.
CoRR, 2023

Communication-Efficient and Error-Free Gradecast with Optimal Resilience.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
On Distributed Computing With Heterogeneous Communication Constraints.
IEEE/ACM Trans. Netw., 2022

2021
Adding Common Randomness Can Remove the Secrecy Penalty in GDoF.
IEEE Trans. Inf. Theory, 2021

Communication-Efficient Signature-Free Asynchronous Byzantine Agreement.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Secure Communications with Limited Common Randomness at Transmitters.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Wireless MapReduce Distributed Computing.
IEEE Trans. Inf. Theory, 2019

Adding a Helper Can Totally Remove the Secrecy Constraints in a Two-User Interference Channel.
IEEE Trans. Inf. Forensics Secur., 2019

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks.
CoRR, 2019

How to Break the Limits of Secrecy Constraints in Communication Networks?
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Adding a Helper Can Totally Remove the Secrecy Constraints in Interference Channel.
CoRR, 2018

Distributed Computing with Heterogeneous Communication Constraints: The Worst-Case Computation Load and Proof by Contradiction.
CoRR, 2018


  Loading...