George Barmpalias

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

Coauthor Index

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

Colors in the list of coauthors