George Barmpalias

	2012
37		George Barmpalias: Tracing and domination in the Turing degrees. Ann. Pure Appl. Logic 163(5): 500-505 (2012)
	2011
36		George Barmpalias, André Nies: Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Logic 162(6): 465-473 (2011)
35		George Barmpalias: Universal computably enumerable sets and initial segment prefix-free complexity CoRR abs/1110.1864: (2011)
34		George Barmpalias, Angsheng Li: Kolmogorov complexity and computably enumerable sets CoRR abs/1111.4339: (2011)
33		George Barmpalias: On Strings with Trivial Kolmogorov Complexity. Int. J. Software and Informatics 5(4): 579-593 (2011)
32		George Barmpalias, Rod Downey, Keng Meng Ng: Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011)
31		George Barmpalias, C. S. Vlek: Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412(41): 5656-5667 (2011)
30		George Barmpalias, T. F. Sterkenburg: On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412(52): 7133-7146 (2011)
	2010
29		George Barmpalias: Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Logic 161(7): 923-934 (2010)
28		George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng: The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010)
27		George Barmpalias: Relative Randomness and Cardinality. Notre Dame Journal of Formal Logic 51(2): 195-205 (2010)
	2009
26		George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19(1): 3-16 (2009)
25		George Barmpalias, Anthony Morphett: Non-cupping, measure and computably enumerable splittings. Mathematical Structures in Computer Science 19(1): 25-43 (2009)
	2008
24		George Barmpalias, Andrew E. M. Lewis, Frank Stephan: I classes, LR degrees and Turing degrees. Ann. Pure Appl. Logic 156(1): 21-38 (2008)
23		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)
22		George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008)
	2007
21		George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
20		George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Working with the LR Degrees. TAMC 2007: 89-99
19		Andrew E. M. Lewis, George Barmpalias: Randomness and the linear degrees of computability. Ann. Pure Appl. Logic 145(3): 252-257 (2007)
18		George Barmpalias, Antonio Montalbán: A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Electr. Notes Theor. Comput. Sci. 167: 17-31 (2007)
17		Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
16		George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber: Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007)
	2006
15		Bahareh Afshari, George Barmpalias, S. Barry Cooper: Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703
14		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)
13		George Barmpalias: Random non-cupping revisited. J. Complexity 22(6): 850-857 (2006)
12		Andrew E. M. Lewis, George Barmpalias: Random reals and Lipschitz continuity. Mathematical Structures in Computer Science 16(5): 737-749 (2006)
11		George Barmpalias, Andrew E. M. Lewis: A C.E. Real That Cannot Be SW-Computed by Any Omega Number. Notre Dame Journal of Formal Logic 47(2): 197-209 (2006)
10		George Barmpalias, Andrew E. M. Lewis: The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame Journal of Formal Logic 47(3): 361-370 (2006)
	2005
9		George Barmpalias: Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE 2005: 8-17
8		George Barmpalias: Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44(8): 1045-1065 (2005)
7		Xizhong Zheng, Robert Rettinger, George Barmpalias: h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005)
	2004
6		George Barmpalias: Approximation Representations for ?2 Reals. Arch. Math. Log. 43(8): 947-964 (2004)
5		George Barmpalias: Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50(4-5): 370-380 (2004)
	2003
4		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		George Barmpalias: A transfinite hierarchy of reals. Math. Log. Q. 49(2): 163-172 (2003)
	2002
1		George Barmpalias: On 0'-computable Reals. Electr. Notes Theor. Comput. Sci. 66(1): 1-12 (2002)

Coauthor Index

1	Bahareh Afshari	[15] [17]
2	Paul Brodhead	[16] [23]
3	Douglas A. Cenzer (Douglas Cenzer)	[16] [21] [23] [26]
4	S. Barry Cooper	[15] [17]
5	Seyyed Dashti	[16]
6	Rodney G. Downey (Rod Downey)	[32]
7	Andrew E. M. Lewis	[10] [11] [12] [14] [19] [20] [22] [24] [28]
8	Angsheng Li	[34]
9	Antonio Montalbán	[18]
10	Anthony Morphett	[25]
11	Keng Meng Ng	[28] [32]
12	André Nies	[36]
13	Jeffrey B. Remmel	[21] [23] [26]
14	Robert Rettinger	[7]
15	Mariya Ivanova Soskova	[20] [22]
16	Frank Stephan	[17] [24]
17	T. F. Sterkenburg	[30]
18	C. S. Vlek	[31]
19	Rebecca Weber	[16] [21] [23] [26]
20	Xizhong Zheng	[4] [7]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page