Concepedia

George Barmpalias

GB

20

Publications

383

Citations

14

H-Index

2005

Active since

Affiliations

University of Leeds(Current)

Victoria University of Wellington

Institute of Software

Chinese Academy of Sciences

London School of Economics and Political Science

George Barmpalias is an author at University of Leeds specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityProbabilityEntropyDiscrete MathematicsTheory Of ComputingCoding TheoryFormal MethodsStatistics

Publications per year

2005–2014

20

Publications

20

Algorithmic Randomness of Closed Sets

George Barmpalias, Paul Brodhead, Douglas Cenzer et al. · Journal of Logic and Computation · 2007 · 37 citations

Mathematical Programming, Computational Complexity Theory, Engineering +16

Digital Morphogenesis via Schelling Segregation

George Barmpalias, Richard Elwes, Andy Lewis-Pye · 2014 · 36 citations

Segregation Looks, Game Theory, Network Analysis +17

Randomness, lowness and degrees

George Barmpalias, Andrew E. M. Lewis, Mariya I. Soskova · Journal of Symbolic Logic · 2008 · 29 citations

Engineering, Computational Complexity, Mathematical Statistic +17

The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="italic"><mml:mi>ibT</mml:mi></mml:mstyle></mml:math> degrees of computably enumerable sets are not dense

George Barmpalias, Andrew E. M. Lewis · Annals of Pure and Applied Logic · 2005 · 24 citations

Mstyle Mathvariant=, Math Xmlns, Enumerable Sets +1

Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees

George Barmpalias, Rod Downey, Noam Greenberg · Transactions of the American Mathematical Society · 2009 · 22 citations · Full text

Computational Complexity Theory, Engineering, Weak Truth-table Reducible +12

Rows per page

1–5 of 20