The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

George Barmpalias: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Xizhong Zheng, George Barmpalias
    On the Monotonic Computability of Semi-computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:290-300 [Conf]
  3. Bahareh Afshari, George Barmpalias, S. Barry Cooper
    Immunity Properties and the n-C.E. Hierarchy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:694-703 [Conf]
  4. George Barmpalias
    Approximation Representations for ?2 Reals. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:8, pp:947-964 [Journal]
  5. 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]
  6. 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]
  7. 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]
  8. George Barmpalias
    On 0'-computable Reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  9. 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]
  10. George Barmpalias
    Random non-cupping revisited. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:6, pp:850-857 [Journal]
  11. 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]
  12. George Barmpalias
    A transfinite hierarchy of reals. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:2, pp:163-172 [Journal]
  13. 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]
  14. Xizhong Zheng, Robert Rettinger, George Barmpalias
    h-monotonically computable real numbers. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:2, pp:157-170 [Journal]
  15. George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
    K -Trivial Closed Sets and Continuous Functions. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:135-145 [Conf]
  16. George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
    Working with the LR Degrees. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:89-99 [Conf]

  17. Algorithmic randomness of continuous functions. [Citation Graph (, )][DBLP]


  18. I classes, LR degrees and Turing degrees. [Citation Graph (, )][DBLP]


  19. Elementary differences between the degrees of unsolvability and degrees of compressibility. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002