|
|
Institute for Computer Science, FIT 1-203,
Tsinghua University Beijing, 100084, China Tel No: 86-10-62792230 86-10-62781693 Ext.1202 Fax: 86-10-62797331 Email: xiaomings@tsinghua.edu.cn |
|
|
| Education Employment Professional Service Awards Publications |
| Tsinghua University, Beijing, China. PhD in Computer Science, 2005 | |
| Tsinghua University, Beijing, China. BS in Computer Science, 2001 |
| Assistant Professor, Center for Advanced Study, Tsinghua University, 2005.8-2008.12. | |
| Associate Professor, Center for Advanced Study, Tsinghua University, 2009.1-present. |
| Program Committee. The 16th/20th International Symposium on Algorithms and Computation (ISAAC 2005/2009) | |
| Program Committee. The 4th/5th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007/2008) | |
| Program Committee. The 16th Computing: The Australasian Theory Symposium (CATS 2010) |
| Tsinghua Excellent (PhD) Graduate, 2005 | |
| Microsoft Research Fellowship Award, 2004 | |
| HP scholarship for Tsinghua students, 2004 | |
| Legend Scholarship for Tsinghua students, 2003 | |
| Lin Jiaqiao Scholarship of Applied Mathematics, 2001 | |
| Meritorious Winner in The Mathematical Contest in Modeling (MCM 2000) | |
| Gold Medal in the 38th International Mathematical Olympiad (IMO)( Mar del Plata, Argentina, 1997) | |
| First Prize in the 22nd All-Russian Mathematical Olympiad (Ryazan, Russian, 1996) |
|
1 |
On the Quantum Query Complexity of Local Search in Two and Three Dimensions. Xiaoming Sun and Andrew Chi-Chih Yao. ALGORITHMICA 55(3): 576-600 (2009). Earlier version in Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 429-438, Berkeley, CA, Oct. 2006. |
|
2 |
The Antimagicness of the Cartesian Product of Graphs. Yuchen Zhang and Xiaoming Sun. Theoretical Computer Science 410(8-10): 727-735 (2009). |
|
3 |
Graph Design for Secure Multiparty Computation over Non-Abelian Groups. Xiaoming Sun, Andrew Chi-Chih Yao, and Christophe Tartary. Proceeding of 14th International Conference on the Theory and Application of Cryptology and Information Security, pp. 37-53, Melbourne, Australia, Dec. 2008. (Lecture Notes in Computer Science 5350, Springer) |
|
4 |
Quantum Separation of Local Search and Fixed Point Computation. Xi Chen, Xioaming Sun, and Sheng-Hua Teng. Proceedings of 14th Annual International Computing and Combinatorics Conference, pp. 170-179, Dalian, China, Jun. 2008. (Lecture Notes in Computer Science 5092, Springer) |
|
5 |
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems. Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew Chi-Chih Yao. Proceedings of 23rd IEEE Conference on Computational Complexity, pp. 187-198, College Park, MD, Jun. 2008. |
|
6 |
Searching monotone multi-dimensional arrays. Yongxi Cheng, Xiaoming Sun, and Yiqun Lisa Yin. Discrete Mathematics, 308(11): 2213-2221, (2008). |
|
7 |
More Efficient Algorithms for Closest String and Substring Problems. Bin Ma and Xiaoming Sun. Proceedings of 12th Annual International Conference on Research in Computational Molecular Biology, 396-409, Singapore, Mar. 2008. |
|
8 |
Block Sensitivity of Weakly Symmetric Functions. Xiaoming Sun. Theoretical Computer Science, 384(1): 87-91, 2007. |
|
9 |
The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences. Xiaoming Sun and David Woodruff. Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 336-345, New Orleans, LA, Jan. 2007. |
|
10 |
The Existence of Quantum Entanglement Catalysts. Xiaoming Sun, Runyao Duan and Mingsheng Ying. IEEE Transactions on Information Theory 50(1): 75-80 (2005). |
|
11 |
On Complexity of Single-Minded Auction. Ning Chen, Xiaotie Deng, and Xiaoming Sun. Journal of Computer and System Sciences 69(4): 675-687 (2004). |
|
12 |
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? Xiaoming Sun, Andrew Chi-Chih Yao, and Shengyu Zhang. Proceedings of 19th IEEE Conference on Computational Complexity, pp. 286-293, Amherst, Massachusetts, USA, Jun. 2004. |
|
13 |
Fisher Equilibrium Price with a Class of Concave Utility Functions. Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao. Proceedings of 12th Annual European Symposium on Algorithms, pp. 169-179, Bergen, Norway, Sep. 2004. (Lecture Notes in Computer Science 3221, Springer) |
|
14 |
Dynamic Price Sequence and Incentive Compatibility. Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao. Proceedings of 31st International Colloquium on Automata, Languages and Programming, pp. 320-331, Turku, Finland, Jul. 2004. (Lecture Notes in Computer Science 3142, Springer) |
| 15 | Performance Evaluation for Energy Efficient Topological Control in Ad Hoc Wireless Networks. Minming Li, S. Huang, Xiaoming Sun, and Xiao Huang. Theoretical Computer Science 326: 399-408 (2004). |
| 16 | A 3-Party simultaneous Protocol for SUM-INDEX. Xiaoming Sun. ALGORITHMICA 36(1): 89-91 (2003). |
| 17 | Universal and original-preserving quantum copying is impossible. Yuan Feng, Shengyu Zhang, Xiaoming Sun, and Mingsheng Ying. Physics Letters A 297(1-2): 1-3 (2002). |
| 18 | Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination. Xiaoming Sun, Shengyu Zhang, Yuan Feng, and Mingsheng Ying. PHYS REV A 65(4): 044306 (2002). |
| 19 | Upper bound for the success probability of unambiguous discrimination among quantum states. Shengyu Zhang, Yuan Feng, Xiaoming Sun, and Mingsheng Ying. PHYS REV A 64(6): 062103 (2001). |
