dblp.uni-trier.dewww.uni-trier.de

George Barmpalias

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
22EEGeorge Barmpalias, Anthony Morphett: Non-cupping, measure and computably enumerable splittings. Mathematical Structures in Computer Science 19(1): 25-43 (2009)
2008
21EEGeorge Barmpalias, Andrew E. M. Lewis, Frank Stephan: I classes, LR degrees and Turing degrees. Ann. Pure Appl. Logic 156(1): 21-38 (2008)
20EEGeorge Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: Algorithmic randomness of continuous functions. Arch. Math. Log. 46(7-8): 533-546 (2008)
2007
19EEGeorge Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
18EEGeorge Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Working with the LR Degrees. TAMC 2007: 89-99
17EEAndrew E. M. Lewis, George Barmpalias: Randomness and the linear degrees of computability. Ann. Pure Appl. Logic 145(3): 252-257 (2007)
16EEGeorge Barmpalias, Antonio Montalbán: A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Electr. Notes Theor. Comput. Sci. 167: 17-31 (2007)
15EEBahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
14EEGeorge Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber: Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007)
2006
13EEBahareh Afshari, George Barmpalias, S. Barry Cooper: Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703
12EEGeorge Barmpalias, Andrew E. M. Lewis: The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Logic 141(1-2): 51-60 (2006)
11EEGeorge Barmpalias: Random non-cupping revisited. J. Complexity 22(6): 850-857 (2006)
10EEAndrew E. M. Lewis, George Barmpalias: Random reals and Lipschitz continuity. Mathematical Structures in Computer Science 16(5): 737-749 (2006)
2005
9EEGeorge Barmpalias: Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE 2005: 8-17
8EEGeorge Barmpalias: Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44(8): 1045-1065 (2005)
7EEXizhong Zheng, Robert Rettinger, George Barmpalias: h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005)
2004
6EEGeorge Barmpalias: Approximation Representations for ?2 Reals. Arch. Math. Log. 43(8): 947-964 (2004)
5EEGeorge Barmpalias: Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50(4-5): 370-380 (2004)
2003
4EEXizhong Zheng, George Barmpalias: On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300
3 George Barmpalias: The approximation structure of a computably approximable real. J. Symb. Log. 68(3): 885-922 (2003)
2EEGeorge Barmpalias: A transfinite hierarchy of reals. Math. Log. Q. 49(2): 163-172 (2003)
2002
1EEGeorge Barmpalias: On 0'-computable Reals. Electr. Notes Theor. Comput. Sci. 66(1): (2002)

Coauthor Index

1Bahareh Afshari [13] [15]
2Paul Brodhead [14] [20]
3Douglas A. Cenzer (Douglas Cenzer) [14] [19] [20]
4S. Barry Cooper [13] [15]
5Seyyed Dashti [14]
6Andrew E. M. Lewis [10] [12] [17] [18] [21]
7Antonio Montalbán [16]
8Anthony Morphett [22]
9Jeffrey B. Remmel [19] [20]
10Robert Rettinger [7]
11Mariya Ivanova Soskova [18]
12Frank Stephan [15] [21]
13Rebecca Weber [14] [19] [20]
14Xizhong Zheng [4] [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)