YU Haifeng

Dean's Chair Associate Professor
Ph.D. (Computer Science, Duke University, USA, 2002)
M.S. (Computer Science, Duke University, USA, 1999)
B.E. (Computer Science, Shanghai Jiao Tong University, P.R., China, 1997)
651 66802


Research Areas

  • Systems & Networking
  • Algorithms & Theory
  • Security

Research Interests

  • Distributed Algorithms
  • Applied Algorithms in Networking
  • Distributed Systems Security
  • Distributed Computing
  • Communication Complexity


Haifeng's research interests cover Distributed Computing, Distributed Algorithms, Communication Complexity, Applied Algorithms in Networking, and Distributed Systems Security. He has published extensively in various top venues such as JACM, Distributed Computing, PODC, SIGCOMM, Transactions on Networking, Oakland, and CCS, with over 3,000 citations on Google Scholar. He has won several best paper awards, including the best paper award in SIGCOMM 2010. He has also served on the PC of many premier international conferences such as PODC, DISC, SIGCOMM, CCS, and Oakland.

Current Projects

  • Distributed computing in novel network models
  • Distributed computing in permissionless systems
  • Bit mixing coding

Selected Publications

  • Haifeng Yu, Yuda Zhao, and Irvan Jahja, "The Cost of Unknown Diameter in Dynamic Networks." Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'16), July 2016.

  • Ziling Zhou, Binbin Chen, and Haifeng Yu, "Understanding RFID Counting Protocols." IEEE/ACM Transactions on Networking (ToN), Volume 24, Issue 1, pp. 312-327, Feb 2016.

  • Yuda Zhao, Haifeng Yu, and Binbin Chen, "Near-Optimal Communication-Time Tradeoff in Fault-Tolerant Computation of Aggregate Functions." Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'14), July 2014.

  • Binbin Chen, Haifeng Yu, Yuda Zhao, and Phillip B. Gibbons, "The Cost of Fault Tolerance in Multi-Party Communication Complexity." Journal of the ACM, Volume 61, Issue 3, Article 19, May 2014.

  • Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, and Feng Xiao, "SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks." Proceedings of the IEEE Symposium on Security and Privacy (Oakland'08), May 2008.

  • Haifeng Yu and Phillip B. Gibbons, "Optimal Inter-Object Correlation When Replicating for Availability." Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC'07), August 2007.

  • Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, and Abraham Flaxman, "SybilGuard: Defending Against Sybil Attacks via Social Networks." Proceedings of ACM SIGCOMM Conference, September 2006.

Awards & Honours

  • Best Paper Award in ACM SIGCOMM Conference (SIGCOMM¡¯10), 2010.
  • Best Paper Award in ACM/IEEE International Conference on Information Processing in Sensor
  • Networks (IPSN¡¯09), 2009.
  • Best Paper Award in Symposium on Networked Systems Design & Implementation (NSDI¡¯06), 2006.

Teaching (2020/2021)

  • CS4231: Parallel and Distributed Algorithms
  • CS5223: Distributed Systems