|
Department of Computer Science and Mathematics 450 S. Easton Road Glenside, PA 19038 Office: Boyer 103 Tel:
267-620-4803 |
|
- Courses I Taught in Arcadia University
o Calculus (I, II and III)
o Linear Algebra
o Abstract Algebra
o Introduction to Analysis
o Data Structure
o Theory of Computation
- Design and Analysis of Algorithms
To see my teaching in BTU Cottbus, please click HERE and my teaching in the University of Cincinnaty please click HERE.
- Office hours
Spring 2011: Monday and Wednesday 3:30-5:00pm, Tuesday and Thursday 10:00am - 12:00pm, or by appointment.
- Research interests
o Computation Theory
o Algorithmic Foundation of Numeric Computation
o Computability and Complexity in Analysis ( CCA)
o Mathematical Logic
o Foundation of Mathematics.
- Conferences
CCA 2010 (Seventh International Conference on Computability and Complexity in Analysis, Zhenjiang, China)
- Recent Publications
o M. Bauer and X. Zheng. On the weak computability of continuous real functions. CCA 2010, June 21-25, Zhenjiang, China, EPTCS, Vol. 24, 29--40.
o R. Rettinger and X. Zheng. Points on Computable Curves of Computable Lengths. MFCS 2009: 736-743.
o R. Rettinger and X. Zheng. On the computability of the rectifiable simple curves. CCA 2009. Informatik Berichte 353-7/2009, Hagen University, 243-253.
o X. Zheng. Classification of Computably Approximable Real Numbers Theory of Computing Systems, Vol. 43(2008), No. 3-4, 603-624.
o X. Zheng. A hierarchy of computably enumerable reals Fundamenta Informaticae, Vol. 83 (2008), 219 - 230.
o X. Zheng. A computability theory of real numbers CCA'08, August 21-24, Hagen, Germany 2008
o Q. Chen, K. Su and X. Zheng. Primitive recursive real numbers.Mathematical Logic Quarterly, Vol. 53(2007), No. 4/5, 345 -- 360.
o X. Zheng. On the hierarchy of Delta_2 real numbers, Theor.Inform. Appl. 41(2007), no.1, 3--25.
o X. Zheng. Initially-bounded computability and hierarchy of computably enumerable sets, COCOON 07, Banff, Canada, July 16-19, 2007.
o X. Zheng. Finitely bounded effective computability, CCA'07, June 16-18, 2007, Siena, Italy.
o Y. Fan, D. Ding and X. Zheng. Totally d-c.e. Real Numbers, CiE 2007, Siena, Italy, June 19-23, 2007.
o R. Rettinger and X. Zheng. A hierarchy of Turing degrees for divergence bounded computable real numbers, J. Complexity. Vol. 22 (2006), No. 6, 818-826.
o X. Zheng, D. Lu and K. Bao. Divergence bounded computable real numbers, Theor. Comput. Sci., Vol. 351(2006), 27-38.
o K. Su, Q. Chen, A. Sattar, W. Yue, G. Lv and X. Zheng. Verification of Authentication Protocols for Epistemic Goals via SAT Compilation, Journal of Computer Science and Technology, 21(2006), No. 6, 932 -- 943, Springer-Verlag.
o Q. Chen, K. Su and X. Zheng. Primitive Recursiveness of Real Numbers under Different Representations, CCA 2006, Florida, USA, ENTCS 167(2007), 303--304, Elsevier.
o K. Su, Q. Chen, X. Zheng and W. Yue. Reasoning about Knowledge by SAT Solving, CIS 2006, pp536--539, Guangzhou China, IEEE Press.
o X. Zheng. A computability theory of real numbers. CiE 2006, 30 June - 5 July, Swansea. LNCS 3988, pp 584 -594.
A full list of my publications, can be found here.
Here is my publication lists in DBLP and MathSciNet.