George Barmpalias
Orcid: 000000029921760X
According to our database^{1},
George Barmpalias
authored at least 76 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on dnb.info

on dl.acm.org
On csauthors.net:
Bibliography
2024
Inf. Comput., 2024
Inf. Comput., 2024
2023
Theor. Comput. Sci., February, 2023
Inf. Comput., January, 2023
CoRR, 2023
2022
CoRR, 2022
CoRR, 2022
2020
Inf. Comput., 2020
Inf. Comput., 2020
2019
IEEE Trans. Inf. Theory, 2019
2018
J. Comput. Syst. Sci., 2018
Equivalences between learning of data and probability distributions, and their applications.
Inf. Comput., 2018
CoRR, 2018
CoRR, 2018
Comput., 2018
2017
ACM Trans. Comput. Log., 2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
J. Comput. Syst. Sci., 2017
CoRR, 2017
CoRR, 2017
Proceedings of the Computability and Complexity, 2017
2016
J. Comput. Syst. Sci., 2016
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers.
Inf. Comput., 2016
CoRR, 2016
2015
J. Math. Log., 2015
J. Comput. Syst. Sci., 2015
CoRR, 2015
From randomness to order: unperturbed Schelling segregation in two or three dimensions.
CoRR, 2015
2014
Theory and Applications of Models of Computation at the Turing Centenary in China.
Theor. Comput. Sci., 2014
Exact Pairs for the Ideal of the <i>k</i>Trivial Sequences in the Turing Degrees.
J. Symb. Log., 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
Theory Comput. Syst., 2013
Inf. Process. Lett., 2013
Inf. Comput., 2013
CoRR, 2013
Bull. Symb. Log., 2013
Ann. Pure Appl. Log., 2013
2012
J. Log. Comput., 2012
Compactness arguments with effectively closed sets for the study of relative randomness.
J. Log. Comput., 2012
Ann. Pure Appl. Log., 2012
2011
Kolmogorov complexity of initial segments of sequences and arithmetical definability.
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
J. Symb. Log., 2011
Int. J. Softw. Informatics, 2011
Ann. Pure Appl. Log., 2011
2010
Notre Dame J. Formal Log., 2010
J. Symb. Log., 2010
Elementary differences between the degrees of unsolvability and degrees of compressibility.
Ann. Pure Appl. Log., 2010
2009
Math. Struct. Comput. Sci., 2009
J. Log. Comput., 2009
2008
J. Symb. Log., 2008
Ann. Pure Appl. Log., 2008
Arch. Math. Log., 2008
2007
J. Log. Comput., 2007
J. Log. Comput., 2007
Ann. Pure Appl. Log., 2007
Proceedings of the Theory and Applications of Models of Computation, 2007
Proceedings of the Computation and Logic in the Real World, 2007
2006
Notre Dame J. Formal Log., 2006
Notre Dame J. Formal Log., 2006
Math. Struct. Comput. Sci., 2006
J. Complex., 2006
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006
Ann. Pure Appl. Log., 2006
Proceedings of the Theory and Applications of Models of Computation, 2006
2005
Math. Log. Q., 2005
Arch. Math. Log., 2005
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.
Proceedings of the New Computational Paradigms, 2005
2004
Math. Log. Q., 2004
Arch. Math. Log., 2004
2003
Math. Log. Q., 2003
J. Symb. Log., 2003
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
2002
Proceedings of the Computability and Complexity in Analysis, 2002