George Barmpalias - Concepedia

Author

George Barmpalias

Also Known As

Barmapalias, George, Barmpalias, George, Barmpalias, Konstantinos G., G. Barmpalias, GEORGE BARMPALIAS, George Barmpalias, K. G. Barmpalias, K.G. Barmpalias, Konstantinos G. Barmpalias

135

Publications

669

Citations

H-Index

Concepts

All Affiliations

University of Leeds Victoria University of Wellington Institute of Software Chinese Academy of Sciences London School of Economics and Political Science

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	13	16	293
2	Language Studies	1	1	14
3	Management	1	1	11
4	Medicine	1	1	36
5	Biology	1	1	36

George Barmpalias

Publications

383

Citations

H-Index

Page 1

	Year	Citations
Algorithmic Randomness of Closed Sets George Barmpalias, Paul Brodhead, Douglas Cenzer, Journal of Logic and Computation Mathematical ProgrammingComputational Complexity TheoryEngineeringAnalysis Of AlgorithmComputational Complexity	2007	37
Digital Morphogenesis via Schelling Segregation George Barmpalias, Richard Elwes, Andy Lewis-Pye Segregation LooksGame TheoryNetwork AnalysisNetwork DynamicThreshold Behaviour	2014	36
Randomness, lowness and degrees George Barmpalias, Andrew E. M. Lewis, Mariya I. Soskova Journal of Symbolic Logic EngineeringComputational ComplexityMathematical StatisticProof ComplexityLr Degrees	2008	29
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 Mstyle Mathvariant=Math XmlnsEnumerable SetsDiscrete Mathematics	2005	24
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 Computational Complexity TheoryEngineeringWeak Truth-table ReducibleAutomated ReasoningStrong Reducibilities	2009	22
Kolmogorov complexity of initial segments of sequences and arithmetical definability George Barmpalias, Charlotte Vlek Theoretical Computer Science EngineeringComputational ComplexityTime ComplexityComputer ScienceDescriptional Complexity	2011	21
Randomness notions and partial relativization George Barmpalias, Joseph S. Miller, André Nies Israel Journal of Mathematics EngineeringEntropyProbabilistic ComputationProbability TheoryRandomness Notions	2012	20
Tipping Points in 1-Dimensional Schelling Models with Switching Agents George Barmpalias, Richard Elwes, Andy Lewis-Pye Journal of Statistical Physics Mathematical ProgrammingEngineeringSwitching AgentsAutonomous Agent SystemComputer Science	2014	19
The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng Journal of Symbolic Logic Turing MachineEngineeringEntropyEffective RandomnessComputational Complexity	2010	19
Random reals and Lipschitz continuity Andrew E. M. Lewis, George Barmpalias Mathematical Structures in Computer Science Theory Of ComputingMeasure TheoryLipschitz ContinuityEngineeringIncompleteness	2006	17

Page 1