The SCEAS System
| |||||||

## Search the dblp DataBase
George Barmpalias:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- George Barmpalias
**Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.**[Citation Graph (0, 0)][DBLP] CiE, 2005, pp:8-17 [Conf] - Xizhong Zheng, George Barmpalias
**On the Monotonic Computability of Semi-computable Real Numbers.**[Citation Graph (0, 0)][DBLP] DMTCS, 2003, pp:290-300 [Conf] - Bahareh Afshari, George Barmpalias, S. Barry Cooper
**Immunity Properties and the**[Citation Graph (0, 0)][DBLP]*n*-C.E. Hierarchy. TAMC, 2006, pp:694-703 [Conf] - George Barmpalias
**Approximation Representations for ?**[Citation Graph (0, 0)][DBLP]_{2}Reals. Arch. Math. Log., 2004, v:43, n:8, pp:947-964 [Journal] - George Barmpalias
**Hypersimplicity and semicomputability in the weak truth table degrees.**[Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:8, pp:1045-1065 [Journal] - George Barmpalias, Andrew E. M. Lewis
**The ibT degrees of computably enumerable sets are not dense.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2006, v:141, n:1-2, pp:51-60 [Journal] - Andrew E. M. Lewis, George Barmpalias
**Randomness and the linear degrees of computability.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:252-257 [Journal] - George Barmpalias
**On 0'-computable Reals.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal] - George Barmpalias, Antonio Montalbán
**A Cappable Almost Everywhere Dominating Computably Enumerable Degree.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:17-31 [Journal] - George Barmpalias
**Random non-cupping revisited.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2006, v:22, n:6, pp:850-857 [Journal] - George Barmpalias
**The approximation structure of a computably approximable real.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 2003, v:68, n:3, pp:885-922 [Journal] - George Barmpalias
**A transfinite hierarchy of reals.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 2003, v:49, n:2, pp:163-172 [Journal] - George Barmpalias
**Approximation representations for reals and their wtt-degrees.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 2004, v:50, n:4-5, pp:370-380 [Journal] - Xizhong Zheng, Robert Rettinger, George Barmpalias
[Citation Graph (0, 0)][DBLP]*h*-monotonically computable real numbers. Math. Log. Q., 2005, v:51, n:2, pp:157-170 [Journal] - George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
[Citation Graph (0, 0)][DBLP]*K*-Trivial Closed Sets and Continuous Functions. CiE, 2007, pp:135-145 [Conf] - George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
**Working with the**[Citation Graph (0, 0)][DBLP]*LR*Degrees. TAMC, 2007, pp:89-99 [Conf] **Algorithmic randomness of continuous functions.**[Citation Graph (, )][DBLP][Citation Graph (, )][DBLP]*I*classes, LR degrees and Turing degrees.**Elementary differences between the degrees of unsolvability and degrees of compressibility.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |