Yong Zhang

Yong Zhang, associate professor of computer science, joined EMU in 2005. Yong earned his bachelor degree in chemistry from University of Science and Technology of China and his Ph.D degree in computer science from University of South Carolina. His current research interests are computational complexity theory and quantum computation.

• B.S. in Chemistry, University of Science and Technology of China
• M.E., Ph.D. in Computer Science, University of South Carolina

• Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang. Improved Algorithms for Bicluster Editing. To appear in TAMC 2008.
  
• Stephen Fenner, Yong Zhang. On the complexity of the Hidden Subgroup Problem. To appear in TAMC 2008.
  
• Maosen Fang, Stephen Fenner, Frederic Green, Steven Homer, Yong Zhang. Quantum Lower Bounds for Fanout. Quantum Information and Computation, Vol 6, pages 46-57, 2006.
  
• Stephen Fenner, Yong Zhang. Quantum Algorithms for a Set of Group Theoretic Problems. Proceedings of the Ninth IC-EATCS Italian Conference on Theoretical Computer Science, Siena, Italy, October 2005, Springer LNCS 3701, pages 215-227.
  
• Stephen Fenner, Frederic Green, Steven Homer, Yong Zhang. Bounds on the Power of Constant-Depth Quantum Circuits. Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, Luebeck, Germany, August 2005, Springer LNCS 3623, pages 44-55.
  
• László Székely, Hua Wang, Yong Zhang. Some Non-existence Results on Leech Trees. Bulletin of the ICA, Vol 44(2005), pages 37-45.

• Presider, coworker, and Bible study leader of Chinese Christian Church of Harrisonburg
  
• Organizer of the Harrisonburg Chinese mid-Autumn Gospel meeting, Oct 2006, West Side Baptist Church.

• EMU 2007/8 teaching release time and mini-grant.

ACM – Association for Computing Machinery

• Computer Graphics
• Data Structure
• Theory of Computation
• Intermediate Programming—Java

• Member of Information Systems Planning Committee
• Contributor of Integram, departmental newsletter