Regular biography
Andreas Galanis is an Associate Professor of Computer Science at the University of Oxford, Department of Computer Science. His research interests include Algorithms and Complexity Theory, with a focus on Randomised Algorithms and Computational Counting Problems. He is affiliated with the Department of Computer Science at the University of Oxford, located in the Wolfson Building, Parks Road, Oxford. His contact details are provided via email at andreas.galanis@cs.ox.ac.uk and his personal webpage can be accessed at https://www.cs.ox.ac.uk/people/Andreas.Galanis. He has supervised current and past students in his research group.
Scholar-generated biography
Andreas Galanis is a researcher at the University of Oxford specializing in Algorithms and Complexity Theory. His work focuses on the theoretical foundations of algorithms, particularly in the areas of approximation, counting, and sampling. He has made significant contributions to understanding the complexity of counting problems, such as the independent set problem and the Ising model. His research also explores the behavior of Markov chain algorithms and their applications in statistical physics. Galanis's studies often involve the analysis of spin systems, correlation decay, and the complexity of counting solutions to random CNF formulas. His work has implications for both theoretical computer science and statistical physics.