- 孙晓明
- 研究员
| 简历: |
| 1997年9月-2001年7月：清华大学计算机系，学士毕业 2001年9月-2005年7月：清华大学计算机系，博士毕业 2005年8月-2008年12月：清华大学高等研究院，助理研究员 2008年12月-2011年9月：清华大学高等研究院，副研究员 2011年9月至今：中国科学院计算技术研究所 |
| 研究方向: |
| 社会网络与博弈论相关的算法研究、量子计算、通信复杂性、判定树复杂度、组合数学 |
| 社会任职: |
| ACM China Magazine编委, Journal of Computer Science and Technology杂志编委， Math Reviews评论员，CCF中国科学院计算所学生分会指导委员会委员。曾多次担任ISAAC, COCOON, TAMC, AAAC, TQC等国际会议程序委员会委员，STOC, SODA, CCC, PODC, Eurocrypt等国际会议和JCSS, Algorithmica, IEEE/ACM TCBB等期刊审稿人。 |
| 获奖及荣誉: |
| 2013年获中国密码学会优秀青年奖，2012年获首批国家自然科学基金优秀青年基金资助，入选中组部首批青年拔尖人才支持计划。之前还曾获清华大学“学术新人奖”、“青年教师教学优秀奖”、清华大学优秀博士论文一等奖、微软学者等荣誉。 |
| 代表论著: |
|
* Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, and Xiaoming Sun. Space-bounded communication complexity. Proceedings of 4th Innovations in Theoretical Computer Science (ITCS), pp. 159-172, Berkeley,CA, Jan. 2013. * Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, and Andrew Chi-Chih Yao. Graph Coloring Applied to Secure Computation in Non-Abelian Groups, Journal of Cryptology 25(4):557-600 (2012). * John Steinberger, Xiaoming Sun, and Zhe Yang. Stam’s Conjecture and Threshold Phenomena in Collision Resistance. Proceedings of 32nd International Cryptology Conference (CRYPTO), pp. 384-405, Santa Barbara,CA, USA, Aug. 2012. * Magnús Halldórsson, Xiaoming Sun, Mario Szegedy, and Chengu Wang.Streaming and Communication Complexity of Clique Approximation. Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP), pp. 449-460, Warwick, UK, Jul. 2012. * Xiaoming Sun and Chengu Wang. Randomized Communication Complexity for Linear Algebra Problems over Finite Fields. Proceedings of 29th International Symposium on Theoretical Aspects of Computer Science (STACS),pp. 477-488, Paris, France, Feb. 2012. * Xi Chen, Xioaming Sun, and Sheng-Hua Teng. Quantum Separation of Local Search and Fixed Point Computation. ALGORITHMICA 56(3): 364-382 (2010). * Bin Ma and Xiaoming Sun. More Efficient Algorithms for Closest String and Substring Problems. SIAM Journal on Computing 39(4): 1432-1443 (2009). * Xiaoming Sun and Andrew Chi-Chih Yao. On the Quantum Query Complexity of Local Search in Two and Three Dimensions. ALGORITHMICA 55(3): 576-600 (2009). * Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew Chi-Chih Yao. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems. Proceedings of 23rd IEEE Conference on Computational Complexity (CCC), pp. 187-198, College Park, MD, Jun. 2008. * Xiaoming Sun. Block Sensitivity of Weakly Symmetric Functions. Theoretical Computer Science 384(1): 87-91 (2007). * Xiaoming Sun and David Woodruff. The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences.Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.336-345, New Orleans, LA, Jan. 2007. * Xiaoming Sun, Runyao Duan, and Mingsheng Ying. The Existence of Quantum Entanglement Catalysts. IEEE Transactions on Information Theory 50(1): 75-80 (2005). * Ning Chen, Xiaotie Deng, and Xiaoming Sun. On Complexity of Single-Minded Auction. Journal of Computer and System Sciences 69(4): 675-687 (2004). * Xiaoming Sun, Andrew Chi-Chih Yao, and Shengyu Zhang. Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? Proceedings of 19th IEEE Conference on Computational Complexity (CCC), pp. 286-293,Amherst, MA, Jun. 2004. * Xiaoming Sun. A 3-Party simultaneous Protocol for SUM-INDEX. ALGORITHMICA 36(1): 89-91 (2003). |
| 承担科研项目情况: |
|
1.“量子计算复杂性与经典计算复杂性的关系”，国家自然科学基金青年基金，项目负责人 2.“智能信息处理的理论和方法”，国家自然科学基金创新群体项目，项目骨干 3.“安全计算学重大理论问题研究”，973项目，项目骨干 4.“数据流模型与判定树模型中的几个问题研究”，国家自然科学基金面上项目，项目负责人 5. “理论计算机科学”，国家自然科学基金优秀青年基金，项目负责人 |
| 学科类别: |
| 计算机软件与理论 |
| 所属部门: |
| 前瞻研究实验室 |
| 专家类别: |
| 正高 |
| 杰青入选时间: |
| 百人入选时间: |
| 其他备注: |
| 博导计算机软件与理论 |
| 其他备注2: |
| 其他备注3: |
