Angsheng Li

Jiankou Li, Angsheng Li: Characters and patterns of communities in networks. CoRR abs/1301.2957 (2013)

Angsheng Li, Pan Peng: The small-community phenomenon in networks. Mathematical Structures in Computer Science 22(3): 373-407 (2012)

Angsheng Li, Yicheng Pan: Characterizations of locally testable linear- and affine-invariant families. Theor. Comput. Sci. 414(1): 55-75 (2012)

Manindra Agrawal, S. Barry Cooper, Angsheng Li (Eds.): Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Lecture Notes in Computer Science 7287, Springer 2012, isbn 978-3-642-29951-3

Angsheng Li, Peng Zhang: Algorithmic Aspects of Homophyly of Networks. CoRR abs/1207.0316 (2012)

Angsheng Li, Pan Peng: Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure. CoRR abs/1209.5045 (2012)

Angsheng Li, Pan Peng: Testing Small Set Expansion in General Graphs. CoRR abs/1209.5052 (2012)

Angsheng Li: Preface. Int. J. Software and Informatics 5(4): 547-548 (2011)

Angsheng Li, Pan Peng: Community Structures in Classical Network Models. Internet Mathematics 7(2): 81-106 (2011)

Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from some nonuniform nondeterministic complexity classes. J. Comb. Optim. 22(3): 482-493 (2011)

Manindra Agrawal, Angsheng Li: Theory and applications of models of computation (TAMC 2008). Theor. Comput. Sci. 412(18): 1645 (2011)

Angsheng Li, Yicheng Pan: Characterizations of Locally Testable Linear- and Affine-Invariant Families. COCOON 2011: 467-478

Angsheng Li, Linqing Tang: The Complexity and Approximability of Minimum Contamination Problems. TAMC 2011: 298-307

George Barmpalias, Angsheng Li: Kolmogorov complexity and computably enumerable sets. CoRR abs/1111.4339 (2011)

Angsheng Li, Yicheng Pan, Pan Peng: Testing Conductance in General Graphs. Electronic Colloquium on Computational Complexity (ECCC) 18: 101 (2011)

Manindra Agrawal, S. Barry Cooper, Angsheng Li: Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Mathematical Structures in Computer Science 20(5): 705-706 (2010)

Angsheng Li, Peng Zhang: Unbalanced Graph Partitioning. ISAAC (1) 2010: 218-229

Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman (Eds.): Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, isbn 978-3-642-13561-3

Jin-yi Cai, S. Barry Cooper, Angsheng Li: Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). Mathematical Structures in Computer Science 19(1): 5-7 (2009)

Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang: Principal filters definable by parameters in E_bT. Mathematical Structures in Computer Science 19(1): 153-167 (2009)

Angsheng Li: Elementary differences among jump classes. Theor. Comput. Sci. 410(11): 1042-1053 (2009)

Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from Some Nonuniform Nondeterministic Complexity Classes. COCOON 2009: 486-495

S. Barry Cooper, Angsheng Li: On Lachlan's major sub-degree problem. Arch. Math. Log. 47(4): 341-434 (2008)

Paul Brodhead, Angsheng Li, Weilin Li: Continuity of capping in C_bT. Ann. Pure Appl. Logic 155(1): 1-15 (2008)

Huili Gong, Youquan Zhang, Xiaojuan Li, Angsheng Li, Beibei Chen, Huan Zhou, Yonghua Sun: Modeling Atmospheric Effects of InSAR Measurements based on Meris and GPS observations. IGARSS (4) 2008: 978-981

Youquan Zhang, Huili Gong, Xiaojuan Li, Taiguang Liu, Wen Yang, Beibei Chen, Angsheng Li, Yaoming Su: Insar Analysis of Land Subsidence Caused by Groundwater Exploitation in Changping, Beijing, China. IGARSS (2) 2008: 1247-1250

Angsheng Li, Mingji Xia: A Theory for Valiant's Matchcircuits (Extended Abstract). STACS 2008: 491-502

Angsheng Li, Linqing Tang: Derandomizing Graph Tests for Homomorphism. TAMC 2008: 105-115

Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang: Definable Filters in the Structure of Bounded Turing Reductions. TAMC 2008: 116-124

Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li (Eds.): Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings. Lecture Notes in Computer Science 4978, Springer 2008, isbn 978-3-540-79227-7

Angsheng Li, Mingji Xia: A Theory for Valiant's Matchcircuits (Extended Abstract). CoRR abs/0802.2860 (2008)

S. Barry Cooper, Angsheng Li: Preface: Theory and applications of models of computation. Theor. Comput. Sci. 384(1): 1 (2007)

Angsheng Li: Elementary Differences Among Jump Hierarchies. TAMC 2007: 79-88

Chi Tat Chong, Angsheng Li, Yue Yang: The existence of high nonbounding degrees in the difference hierarchy. Ann. Pure Appl. Logic 138(1-3): 31-51 (2006)

Angsheng Li, Guohua Wu, Yue Yang: Bounding computably enumerable degrees in the Ershov hierarchy. Ann. Pure Appl. Logic 141(1-2): 79-88 (2006)

Carl G. Jockusch Jr., Angsheng Li: Restricted jump interpolation in the d.c.e. degrees. Mathematical Structures in Computer Science 16(5): 841-865 (2006)

Angsheng Li, Yan Song, Guohua Wu: Universal Cupping Degrees. TAMC 2006: 721-730

Angsheng Li, Guohua Wu, Yue Yang: On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. TAMC 2006: 731-736

Jin-yi Cai, S. Barry Cooper, Angsheng Li (Eds.): Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Lecture Notes in Computer Science 3959, Springer 2006, isbn 3-540-34021-1

S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang: Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70(3): 741-766 (2005)

Angsheng Li: The Low Splitting Theorem in the Difference Hierarchy. CiE 2005: 287-296

Rod Downey, Angsheng Li, Guohua Wu: Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Logic 125(1-3): 101-118 (2004)

Angsheng Li, Yicheng Zhao: Plus cupping degrees do not form an ideal. Science in China Series F: Information Sciences 47(5): 635-654 (2004)

Marat M. Arslanov, S. Barry Cooper, Angsheng Li: There is no low maximal d. c. e. degree - Corrigendum. Math. Log. Q. 50(6): 628-636 (2004)

Yong Wang, Angsheng Li: A hierarchy for the plus cupping Turing degrees. J. Symb. Log. 68(3): 972-988 (2003)

Dengfeng Li, Angsheng Li: A minimal pair joining to a plus cupping Turing degree. Math. Log. Q. 49(6): 553-566 (2003)

S. Barry Cooper, Angsheng Li, Xiaoding Yi: On the distribution of Lachlan nonsplitting bases. Arch. Math. Log. 41(5): 455-482 (2002)

S. Barry Cooper, Angsheng Li: Splitting and Nonsplitting, II: A Low₂ C.E. Degree above Which 0' Is Not Splittable. J. Symb. Log. 67(4): 1391-1430 (2002)

Angsheng Li: On a conjecture of Lempp. Arch. Math. Log. 39(4): 281-309 (2000)

Angsheng Li: Bounding cappable degrees. Arch. Math. Log. 39(5): 311-352 (2000)

Marat M. Arslanov, S. Barry Cooper, Angsheng Li: There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46(3): 409-416 (2000)

Angsheng Li, Yang Dongping: Bounding Minimal Degrees by Computably Enumerable Degrees. J. Symb. Log. 63(4): 1319-1347 (1998)