So
Man-Cho, Anthony
(Ĭ¤åĦ)
|
 |
| ¡@ |
 |
Anthony Man-Cho So received
his BSE degree in Computer Science from Princeton University in 2000 with minors
in Applied and Computational Mathematics, Engineering and Management Systems,
and German Language and Culture. He then received his MSc degree in Computer
Science in 2002, and his PhD degree in Computer Science with a PhD minor in
Mathematics in 2007, all from Stanford University. Dr. So joined the Department
of Systems Engineering and Engineering Management at the Chinese University of
Hong Kong in 2007. His current research focuses on the interplay between
optimization theory and various areas of algorithm design, such as computational
geometry, stochastic optimization, combinatorial optimization, and algorithmic
game theory.
Research Interests
Algorithm
Design
Algorithmic Game
Theory
Optimization
Selected Publications
A. M.-C. So, Y.
Ye, J. Zhang, "A Unified Theorem on SDP Rank Reduction", Submitted.
A. M.-C. So, J.
Zhang, Y. Ye, "On Approximating Complex Quadratic Optimization
Problems via Semidefinite Programming Relaxations", Mathematical
Programming, Series B, 110:93-110, 2007. (Special Issue on IPCO
2005)
A. M.-C. So, Y.
Ye, "Theory of Semidefinite Programming for Sensor Network
Localization", Mathematical Programming, Series B,
109:367-384, 2007.
A. M.-C. So, J.
Zhang, Y. Ye, "Stochastic Combinatorial Optimization with
Controllable Risk Aversion Level", Proceedings of the 9th
International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems (APPROX 2006), LNCS 4110, pp. 224-235,
2006.
A. M.-C. So, Y.
Ye, "A Semidefinite Programming Approach to Tensegrity Theory and
Realizability of Graphs", Proceedings of the 17th Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA), pp. 766-775, 2006. |