| 2009 |
|---|
| 29 | EE | Angsheng Li,
Weilin Li,
Yicheng Pan,
Linqing Tang:
Principal filters definable by parameters in EbT.
Mathematical Structures in Computer Science 19(1): 153-167 (2009) |
| 28 | EE | 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) |
| 27 | EE | Angsheng Li:
Elementary differences among jump classes.
Theor. Comput. Sci. 410(11): 1042-1053 (2009) |
| 2008 |
|---|
| 26 | | Manindra Agrawal,
Ding-Zhu Du,
Zhenhua Duan,
Angsheng Li:
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings
Springer 2008 |
| 25 | EE | Angsheng Li,
Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract).
STACS 2008: 491-502 |
| 24 | EE | Angsheng Li,
Linqing Tang:
Derandomizing Graph Tests for Homomorphism.
TAMC 2008: 105-115 |
| 23 | EE | Angsheng Li,
Weilin Li,
Yicheng Pan,
Linqing Tang:
Definable Filters in the Structure of Bounded Turing Reductions.
TAMC 2008: 116-124 |
| 22 | EE | Paul Brodhead,
Angsheng Li,
Weilin Li:
Continuity of capping in CbT.
Ann. Pure Appl. Logic 155(1): 1-15 (2008) |
| 21 | EE | S. Barry Cooper,
Angsheng Li:
On Lachlan's major sub-degree problem.
Arch. Math. Log. 47(4): 341-434 (2008) |
| 20 | EE | Angsheng Li,
Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract)
CoRR abs/0802.2860: (2008) |
| 2007 |
|---|
| 19 | EE | Angsheng Li:
Elementary Differences Among Jump Hierarchies.
TAMC 2007: 79-88 |
| 18 | EE | S. Barry Cooper,
Angsheng Li:
Preface: Theory and applications of models of computation.
Theor. Comput. Sci. 384(1): 1 (2007) |
| 2006 |
|---|
| 17 | | Jin-yi Cai,
S. Barry Cooper,
Angsheng Li:
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings
Springer 2006 |
| 16 | EE | Angsheng Li,
Yan Song,
Guohua Wu:
Universal Cupping Degrees.
TAMC 2006: 721-730 |
| 15 | EE | Angsheng Li,
Guohua Wu,
Yue Yang:
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal.
TAMC 2006: 731-736 |
| 14 | EE | 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) |
| 13 | EE | Angsheng Li,
Guohua Wu,
Yue Yang:
Bounding computably enumerable degrees in the Ershov hierarchy.
Ann. Pure Appl. Logic 141(1-2): 79-88 (2006) |
| 12 | EE | 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) |
| 2005 |
|---|
| 11 | EE | Angsheng Li:
The Low Splitting Theorem in the Difference Hierarchy.
CiE 2005: 287-296 |
| 2004 |
|---|
| 10 | EE | Rod Downey,
Angsheng Li,
Guohua Wu:
Complementing cappable degrees in the difference hierarchy.
Ann. Pure Appl. Logic 125(1-3): 101-118 (2004) |
| 9 | EE | 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) |
| 2003 |
|---|
| 8 | | Yong Wang,
Angsheng Li:
A hierarchy for the plus cupping Turing degrees.
J. Symb. Log. 68(3): 972-988 (2003) |
| 7 | EE | Dengfeng Li,
Angsheng Li:
A minimal pair joining to a plus cupping Turing degree.
Math. Log. Q. 49(6): 553-566 (2003) |
| 2002 |
|---|
| 6 | EE | S. Barry Cooper,
Angsheng Li,
Xiaoding Yi:
On the distribution of Lachlan nonsplitting bases.
Arch. Math. Log. 41(5): 455-482 (2002) |
| 5 | | S. Barry Cooper,
Angsheng Li:
Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable.
J. Symb. Log. 67(4): 1391-1430 (2002) |
| 2000 |
|---|
| 4 | EE | Angsheng Li:
On a conjecture of Lempp.
Arch. Math. Log. 39(4): 281-309 (2000) |
| 3 | EE | Angsheng Li:
Bounding cappable degrees.
Arch. Math. Log. 39(5): 311-352 (2000) |
| 2 | EE | 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) |
| 1998 |
|---|
| 1 | | Angsheng Li,
Yang Dongping:
Bounding Minimal Degrees by Computably Enumerable Degrees.
J. Symb. Log. 63(4): 1319-1347 (1998) |
