- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j19 |      | Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle: Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. Theory Comput. Syst. 52(1): 2-27 (2013) |
| 2009 | ||
| j18 | | Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu: Bounding non-GL2 and R.E.A. J. Symb. Log. 74(3): 989-1000 (2009) |
| j17 | | Klaus Weihrauch, Yongcheng Wu, Decheng Ding: Absolutely non-computable predicates and functions in analysis. Mathematical Structures in Computer Science 19(1): 59-71 (2009) |
| 2007 | ||
| j16 | | Wei Wang, Decheng Ding: On the definable ideal generated by the plus cupping c.e. degrees. Arch. Math. Log. 46(3-4): 321-346 (2007) |
| j15 | | Wei Wang, Decheng Ding: On definable filters in computably enumerable degrees. Ann. Pure Appl. Logic 147(1-2): 71-83 (2007) |
| c5 | | Decheng Ding, Klaus Weihrauch, Yongcheng Wu: Absolutely Non-effective Predicates and Functions in Computable Analysis. TAMC 2007: 595-604 |
| 2006 | ||
| j14 | | Yongcheng Wu, Decheng Ding: Computability of measurable sets via effective topologies. Arch. Math. Log. 45(3): 365-379 (2006) |
| c4 | | |
| c3 | | |
| 2005 | ||
| j13 | | Yongcheng Wu, Decheng Ding: Computability of measurable sets via effective metrics. Math. Log. Q. 51(6): 543-559 (2005) |
| c2 | | Zhenyu Chen, Conghua Zhou, Decheng Ding: Automatic abstraction refinement for Petri nets verification. HLDVT 2005: 168-174 |
| 2004 | ||
| j12 | | Liang Yu, Decheng Ding, Rodney G. Downey: The Kolmogorov complexity of random reals. Ann. Pure Appl. Logic 129(1-3): 163-180 (2004) |
| j11 | | |
| 2003 | ||
| j10 | | Liang Yu, Decheng Ding: An extension of Harrington's noncupping theorem. Science in China Series F: Information Sciences 46(3): 199-209 (2003) |
| j9 | | Xishun Zhao, Decheng Ding: Fixed-Parameter Tractability of Disjunction-Free Default Reasoning. J. Comput. Sci. Technol. 18(1): 118-124 (2003) |
| j8 | | Daoyun Xu, Decheng Ding, Zhang Mingyi: Characterization of an Auto-Compatible Default Theory. J. Comput. Sci. Technol. 18(3): 393-398 (2003) |
| 2001 | ||
| j7 | | Xishun Zhao, Decheng Ding: Complexity Results for 2CNF Default Theories. Fundam. Inform. 45(4): 393-404 (2001) |
| j6 | | Xishun Zhao, Decheng Ding: Some Algorithms for Extension Computation of Nonmonotonic Rule Systems. Fundam. Inform. 48(1): 93-106 (2001) |
| 2000 | ||
| j5 | | Xishun Zhao, Decheng Ding, Hans Kleine Büning: Complexity Results for Restricted Credulous Default Reasoning. AI Commun. 13(4): 249-258 (2000) |
| j4 | | Kaile Su, Huowang Chen, Decheng Ding: Two alternative notions of 'possibility' satisfying Halpern's conditions. J. Log. Comput. 10(2): 253-269 (2000) |
| j3 | | Lu Hong, Decheng Ding, Lei Qian: A Splitting with Infimum in the d-c. e. Degrees. Math. Log. Q. 46(1): 53-76 (2000) |
| 1997 | ||
| c1 | | Kaile Su, Decheng Ding, Huowang Chen: A Three-Valued Quantificational Logic of Context. COCOON 1997: 343-352 |
| 1996 | ||
| j2 | | Decheng Ding, Lei Qian: Isolated d.r.e. degrees are dense in r.e. degree structure. Arch. Math. Log. 36(1): 1-10 (1996) |
| 1994 | ||
| j1 |  | Decheng Ding, Klaus Ambos-Spies: Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. Math. Log. Q. 40: 287-317 (1994) |
Colors in the list of coauthors
Last update Sun May 19 06:43:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page