Fang Yu
Researcher
1065 La Avenida
Mountain View, CA 94043
Phone: 650-693-2101
Fang received her Ph.D. degree from the EECS Department at University of California at Berkeley. She received her M.S. degree in Computer Science from UC Berkeley in 2002, and her B.S. degree in Computer Science from Fudan University, China in 2000. Her research interests center on large scale networking systems, with a focus on developing algorithms for better classification of network traffic to filter malicious traffic such as worms.
Currently, Fang is working on the S-GPS project, focusing on detecting spammers using network level information, and the PSAT project, aiming to speedup the SAT solver through FPGA.
Recent Publications
- Yinglian Xie, Fang Yu, and Martin Abadi, De-anonymizing the Internet Using Unreliable IDs, in ACM SIGCOMM, August 2009
- Yao Zhao, Yinglian Xie, Fang Yu, Qifa Ke, Yuan Yu, Yan Chen, and Eliot Gillum, BotGraph: Large Scale Spamming Botnet Detection, in The 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI '09), USENIX, April 2009
- Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, and Ivan Osipkov, Spamming Botnet: Signatures and Characteristics, in ACM SIGCOMM 2008, Seattle, WA, August 2008
- John D. Davis, Zhangxi Tan, Fang Yu, and Lintao Zhang, A Practical Reconfigurable Hardware Accelerator for Boolean Satisfiability Solvers, in 45th Design Automation Conference, Association for Computing Machinery, Inc., June 2008
- John D. Davis, Zhangxi Tan, Fang Yu, and Lintao Zhang, Designing an Efficient Hardware Implication Accelerator for SAT Solving, in International Conference on Theory and Applications of Satisfiability Testing (SAT), Springer, Guangzhou, China, May 2008
- Yinglian Xie, Fang Yu, Kannan Achan, Eliot Gillum, Moisés Goldszmidt, and Ted Wobber, How Dynamic are IP Addresses, in Proceedings of the ACM SIGCOMM Conference, Association for Computing Machinery, Inc., Kyoto, Japan, August 2007
