地图     English
潘祎诚

出自计算机科学国家重点实验室

首页 > 人才队伍 > 博士研究生 > 潘祎诚
跳转到: 导航, 搜索

博士研究生
导师:李昂生
研究方向:Computational Complexity, Algorithms, Complex Network Theory
邮箱: yicheng(at)ios.ac.cn
个人介绍:

  • Research interests:
  1. Computational Complexity
  2. Algorithms
  3. Complex Network Theory
  • Education:
  1. B.S. Beijing Jiaotong University, Information and Computation Sciences, 2001-2005;
  2. Ph.D. candidate Institute of Software, Chinese Academy of Sciences, Computer Science, 2005-now.
  • Publications:
  1. A. Li, Y. Pan. Characterizations of locally testable linear- and affine-invariant families. Theoretical Computer Science, 414(1), 55-75, 2012. (Preliminary version COCOON 2011.)
  2. A. Li, W. Li, Y. Pan, L. Tang: Principal filters definable by parameters in EbT. Mathematical Structures in Computer Science 19(1): 153-167 (2009).
  3. A. Li, W. Li, Y. Pan, L. Tang: Definable Filters in the Structure of Bounded Turing Reductions. TAMC 2008: 116-124.
  • Professional talks:
  1. Algebraic property test, Algorithm and Information Day, Institute of Software, Chinese Academy of Sciences, May, 2010.

版权所有 © 中国科学院软件研究所计算机科学国家重点实验室 Powered by MediaWiki
京ICP备05046678号