基本信息
孙晓明男博导中国科学院计算技术研究所
电子邮件: sunxiaoming@ict.ac.cn
通信地址: 中国科学院计算技术研究所
邮政编码: 100190
研究领域算法和计算复杂性
招生信息
课题组主页:http://theory.ict.ac.cn/en/
招生专业081202-计算机软件与理论
招生方向 博弈论与社会网络,近似算法,量子计算,通信复杂性
判定树复杂性
教育背景
学位•清华大学,计算机博士,2005
•清华大学,计算机学士,2001
工作经历•助理研究员,清华大学高等研究院, 2005.8-2008.12.
•副研究员,清华大学高等研究院,2008.12-2011.9.
•研究员,中国科学院计算技术研究所,2011.9-至今.
教授课程 高级算法设计
专利与奖励2013年获中国密码学会优秀青年奖,2012年获首批国家自然科学基金优秀青年基金资助,入选中组部首批青年拔尖人才支持计划。之前还曾获清华大学“学术新人奖”、“青年教师教学优秀奖”、清华大学优秀博士论文一等奖、微软等荣誉。
科研活动•“数据流模型与判定树模型中的几个问题研究”,国家自然科学基金面上项目,项目负责人,经费57万,2012.1-2015.12
•“理论计算机科学”,国家自然科学基金优秀青年科学基金项目,项目负责人,经费100万,2013.1-2015.12
指导学生现指导学生
张佳硕士研究生081202-计算机软件与理论
李乾博士研究生081202-计算机软件与理论
出版信息• Raghav Kulkarni, Youming Qiao, Xiaoming Sun. Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. Proceedings of 10th International Conference on Theory and Applications of Models of Computation (TAMC), pp. 224-235, Hong Kong, May 2013.
•Yihan Gao, Jieming Mao, Xiaoming Sun, and Song Zuo. On the sensitivity complexity of bipartite graph properties, Theoretical Computer Science 468(14): 83-91 (2013).
•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, Chengu Wang, and Wei Yu. The Relationship between Inner Product and Counting Cycles. Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN), pp. 643-654, Arequipa, Peru, Apr. 2012.
•Joshua Brody, Hongyu Liang, and Xiaoming Sun. Space-Efficient Approximation Scheme for Circular Earth Mover Distance. Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN), pp. 97-108, Arequipa, Peru, Apr. 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.
•Tengyu Ma, Xiaoming Sun, and Huacheng Yu. A New Variation of Hat Guessing Games. 17th Annual International Computing and Combinatorics Conference (COCOON), pp. 616-626, Dallas, TX, USA, Aug. 2011.
•Xiaoming Sun. An Improved Lower Bound on the Sensitivity Complexity of Graph Properties. Theoretical Computer Science 412(29): 3524-3529 (2011).
•Xue Chen, Guangda Hu, and Xiaoming Sun. A Better Upper Bound on Weights of Exact Threshold Functions. 8th International Conference on Theory and Applications of Models of Computation (TAMC), pp. 124-132, Tokyo, Japan, May 2011.
•Tiancheng Lou, Xiaoming Sun, and Christophe Tartary. Bounds and trade-offs for Double-Base Number Systems. Information Processing Letters 111(10): 488-493, (2011).
•Xue Chen, Guangda Hu, and Xiaoming Sun. On the Complexity of Word Circuits. Discrete Mathematics, Algorithms and Application 2(4): 483-492, (2010). Earlier version in Proceedings of 16th Annual International Computing and Combinatorics Conference (COCOON), pp. 308-317, Nha Trang, Vietnam, Jul. 2010.
•Laszlo Babai, Kristoffer Hansen, Vladimir Podolskii, and Xiaoming Sun. Weights of Exact Threshold Functions. Proceedings of 35th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 66-77, Brno, Czech Republic, Aug. 2010.
•Xi Chen, Xioaming Sun, and Sheng-Hua Teng. Quantum Separation of Local Search and Fixed Point Computation. ALGORITHMICA 56(3): 364-382 (2010). A preliminary version appeared in Proceedings of 14th Annual International Computing and Combinatorics Conference (COCOON), pp. 170-179, Dalian, China, Jun. 2008.
•Bin Ma and Xiaoming Sun. More Efficient Algorithms for Closest String and Substring Problems. SIAM Journal on Computing 39(4): 1432-1443 (2009). A preliminary version appeared in Proceedings of 12th Annual International Conference on Research in Computational Molecular Biology (RECOMB), 396-409, Singapore, Mar. 2008.
•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). Earlier version in Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 429-438, Berkeley, CA, Oct. 2006.
•Yuchen Zhang and Xiaoming Sun. The Antimagicness of the Cartesian Product of Graphs. Theoretical Computer Science 410(8-10): 727-735 (2009).
•Xiaoming Sun, Andrew Chi-Chih Yao, and Christophe Tartary. Graph Design for Secure Multiparty Computation over Non-Abelian Groups. Proceeding of 14th International Conference on the Theory and Application of Cryptology and Information Security (AsiaCrypt), pp. 37-53, Melbourne, Australia, Dec. 2008.
•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.
•Yongxi Cheng, Xiaoming Sun, and Yiqun Lisa Yin. Searching Monotone Multi-dimensional Arrays. Discrete Mathematics 308(11): 2213-2221, (2008).
•Xiaoming Sun. Block Sensitivity of Weakly Symmetric Functions. Theoretical Computer Science 384(1): 87-91 (2007). Conference version in Proceedings of Theory and Applications of Models of Computation (TAMC), pp. 339-344, Beijing, May 2006.
•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.
•Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao. Fisher Equilibrium Price with a Class of Concave Utility Functions. Proceedings of 12th Annual European Symposium on Algorithms (ESA), pp. 169-179, Bergen, Norway, Sep. 2004.
•Ning Chen, Xiaotie Deng, Xiaoming Sun, and Andrew Chi-Chih Yao. Dynamic Price Sequence and Incentive Compatibility. Proceedings of 31st International Colloquium on Automata, Languages and Programming (ICALP), pp. 320-331, Turku, Finland, Jul. 2004.
•Minming Li, S. Huang, Xiaoming Sun, and Xiao Huang. Performance Evaluation for Energy Efficient Topological Control in Ad Hoc Wireless Networks. Theoretical Computer Science 326: 399-408 (2004).
•Xiaoming Sun. A 3-Party simultaneous Protocol for SUM-INDEX. ALGORITHMICA 36(1): 89-91 (2003).
•Yuan Feng, Shengyu Zhang, Xiaoming Sun, and Mingsheng Ying. Universal and Original-Preserving Quantum Copying is Impossible. Physics Letters A 297(1-2): 1-3 (2002).
•Xiaoming Sun, Shengyu Zhang, Yuan Feng, and Mingsheng Ying. Mathematical Nature of and a Family of Lower Bounds for the Success Probability of Unambiguous Discrimination. Physical Review A 65(4): 044306 (2002).
•Shengyu Zhang, Yuan Feng, Xiaoming Sun, and Mingsheng Ying. Upper Bound for the Success Probability of Unambiguous Discrimination among Quantum States. Physical Review A 64(6): 062103 (2001).
删除或更新信息,请邮件至freekaoyan#163.com(#换成@)
中国科学院大学研究生导师教师师资介绍简介-孙晓明
本站小编 Free考研考试/2020-04-28
相关话题/中国科学院大学 师资
中国科学院大学研究生导师教师师资介绍简介-孙晓敏
基本信息孙晓敏男博导中国科学院地理科学与资源研究所电子邮件:sunxm@igsnrr.ac.cn通信地址:北京朝阳区大屯路甲11号邮政编码:100101部门/实验室:生态系统水分研究中心研究领域主要从事生态系统地表通量观测和稳定同位素生态学研究。招生信息稳定同位素生态学招生方向地表通量观测研究,稳定同位素生态学教授课程陆地表层系统野外实验原理和方法生态系统观测与实验的基本原理与方法专利与奖励奖励信 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙晓娟
基本信息孙晓娟女博导中国科学院长春光学精密机械与物理研究所电子邮件:sunxj@ciomp.ac.cn通信地址:吉林省长春市东南湖大路3888号,中科院长春光机所邮政编码:研究领域招生信息招生专业070205-凝聚态物理招生方向宽禁带半导体光电材料与器件,表面等离激元教育背景2009-09--2012-07中国科学院大学/中科院长春光机所博士学位2004-09--2007-07大连理工大学硕士研究 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙晓蕾
基本信息孙晓蕾女硕导中国科学院科技政策与管理科学研究所电子邮件:xlsun@casipm.ac.cn通信地址:北京市海淀区中关村北一条15号邮政编码:100190研究领域风险相关性国家风险,能源安全招生信息招生专业120100-管理科学与工程招生方向风险管理教育背景2004-09--2010-01中国科学院大学博士学位2000-09--2004-06合肥工业大学学士学位工作经历工作简历2016-1 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙晓刚
基本信息孙晓刚男研究员(正)研究生导师中国科学院成都计算机应用研究所电子邮件:**@qq.com通信地址:四川省成都市人民南路4段9号计算机所717室邮政编码:610041研究领域人工智能、深度神经网络、人脸识别以及人体姿态检测、机器视觉招生信息深度学习、机器视觉(人脸识别、行为识别、物体检测、质量检测)招生方向深度神经网络高速机器视觉图像处理及机器学习教育背景2008-09--2011-07中科 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙小涓
基本信息孙小涓女硕导中国科学院空天信息创新研究院电子邮件:xjsun@mail.ie.ac.cn通信地址:中关村北一条9号科电大厦802室邮政编码:研究领域招生信息招生专业081002-信号与信息处理招生方向空间信息处理系统体系结构,空间信息大数据处理与分析技术教育背景学历学位工作经历工作简历社会兼职教授课程专利与奖励奖励信息专利成果出版信息发表论文发表著作科研活动科研项目参与会议合作情况项目协作 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙小进
基本信息孙小进男硕导中国科学院上海技术物理研究所电子邮件:sonsyojin110@sina.com通信地址:虹口区玉田路500号邮政编码:200083研究领域招生信息招生专业080203-机械设计及理论080300-光学工程招生方向光学仪器结构设计,分析光机热集成分析教育背景1996-06--2000-06北京机械工业学院学士学历学位工作经历工作简历1996-06~2000-06,北京机械工业学 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙向阳
基本信息孙向阳男中国科学院水利部成都山地灾害与环境研究所电子邮件:sunxiangyang@imde.ac.cn通信地址:人民南路四段9号成都山地所1号楼邮政编码:610041研究领域主要从事森林生态系统水碳循环及耦合研究,解决森林生态系统耗水与固碳的关系问题,同时从事森林生态系统碳储量、固碳速率及潜力研究等科研工作;负责国家重点野外科学观测试验站贡嘎山站的水碳通量观测工作。招生信息招收硕士研究生 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙小淳
基本信息孙小淳男博导人文学院电子邮件:xcsun@ucas.ac.cn通信地址:北京市中关村东路55号邮政编码:100190研究领域科学技术史;天文学史;科学社会学;科学哲学招生信息招收科学技术史专业的博士研究生和硕士研究生,一般每年各招1名。考生本科专业背景不限,数理专业优先。对科学史和一般文史哲有一定的兴趣。外语比较好。招生专业071200-科学技术史010108-科学技术哲学招生方向天文学史 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙向南
基本信息孙向南男中国科学院国家纳米科学中心电子邮件:sunxn@nanoctr.cn通信地址:中关村北一条11号国家纳米科学中心邮政编码:100190博士生导师,中国科学院“****”入选者。2007-2011年在中国科学院化学研究所攻读博士学位,从事有机光电器件方面的研究工作,导师为刘云圻院士。2012-2015年在西班牙CICNanogune研究中心Luis.E.Hueso教授课题组从事有机自 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28中国科学院大学研究生导师教师师资介绍简介-孙向红
基本信息孙向红女博导中国科学院心理研究所电子邮件:sunxh@psych.ac.cn通信地址:朝阳区望京花园120-1-402邮政编码:100102研究领域招生信息招生专业040203-应用心理学招生方向工程心理学(3)教育背景1998-09--2001-12中科院心理研究所博士1994-09--1996-06中科院心理研究所硕士1985-09--1989-06武汉大学学士学位学历学位工作经历工作 ...中国科学院大学师资导师 本站小编 Free考研考试 2020-04-28