COM2-04-25
651 66802

https://www.comp.nus.edu.sg/~yuhf

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)

Haifeng's current research interests include Distributed Systems Security (e.g., blockchains and sybil attacks), Distributed Algorithms, Distributed Computing, and Algorithms in Networking. He has published extensively in various top venues such as JACM, Distributed Computing, PODC, SIGCOMM, Transactions on Networking, Oakland, and CCS. He has won several best paper awards, including the best paper award in SPAA 2020 and SIGCOMM 2010. He has also served on the PC of many premier international conferences such as PODC, DISC, SIGCOMM, CCS, and Oakland.

RESEARCH INTERESTS

  • Distributed Systems Security (e.g., blockchains and sybil attacks)

  • Distributed Algorithms

  • Algorithms in Networking

  • Distributed Computing

RESEARCH PROJECTS

Massively Parallel Aggregation in Dynamic Networks


BCube: Overcoming the 50% Barrier in Blockchains


You See the Whole Picture When the Puzzle Pieces Match


RESEARCH GROUPS

TEACHING INNOVATIONS

SELECTED PUBLICATIONS

  • Ruomu Hou, Haifeng Yu, and Prateek Saxena, "Using Throughput-Centric Byzantine Broadcast to Tolerate Malicious Majority in Blockchains." Proceedings of the IEEE Symposium on Security and Privacy (Oakland'22), May 2022.
  • Irvan Jahja, Haifeng Yu, and Ruomu Hou, "On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries." Journal of Parallel and Distributed Computing, Volume 159, pp. 35-50, Jan 2022.
  • Haifeng Yu, Ivica Nikolic, Ruomu Hou, and Prateek Saxena, "OHIE: Blockchain Scaling Made Simple." Proceedings of the IEEE Symposium on Security and Privacy (Oakland'20), May 2020.
  • Irvan Jahja and Haifeng Yu, "Sublinear Algorithms in T-interval Dynamic Networks." Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'20), July 2020. Awarded Best Paper.
  • Irvan Jahja, Haifeng Yu, and Yuda Zhao, "Some Lower Bounds in Dynamic Networks with Oblivious Adversaries." Distributed Computing, Volume 33, Issue 1, pp. 1-40, Feb 2020.
  • aifeng Yu, Yuda Zhao, and Irvan Jahja., "The Cost of Unknown Diameter in Dynamic Networks." Journal of the ACM, Volume 65, Issue 5, Article 31, September 2018.

AWARDS & HONOURS

  • Awarded Best Paper in ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.

  • Best Paper Award in ACM SIGCOMM Conference (SIGCOMM), 2010.

  • Best Paper Award in ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), 2009.

  • Best Paper Award in Symposium on Networked Systems Design & Implementation (NSDI), 2006.

MODULES TAUGHT

CS4231
Parallel and Distributed Algorithms
CS5223
Distributed Systems