معرفی
Silvia Butti is a Senior Research Associate in the Department of Computer Science at the University of Oxford, where she also holds a Junior Research Fellowship at Lady Margaret Hall. She specializes in theoretical computer science, focusing on constraint satisfaction problems (CSPs), algebraic methods, approximation algorithms, and computational complexity. Her research bridges theoretical foundations with applications in distributed computing and combinatorial optimization.
She earned her PhD from Universitat Pompeu Fabra (Barcelona, Spain) in 2022, supervised by Victor Dalmau, and holds an MSc in Mathematics and Foundations of Computer Science from the University of Oxford (2018) and a BSc in Mathematics from University College London (2017). Her academic journey is supported by prestigious fellowships, including the INPhINIT “la Caixa” and Marie Skłodowska-Curie Actions.
Her research interests include the algebraic analysis of CSPs, inapproximability, and the interplay between hierarchies like Sherali-Adams and Weisfeiler-Leman invariants. She actively contributes to conferences such as LICS, MFCS, and CP, and has published extensively on topics ranging from promise problems to distributed algorithms.
Dr. Butti teaches courses on computational complexity, combinatorial optimization, and probability and computing at the University of Oxford. She is committed to science communication, engaging with outreach initiatives like Maths Fest, the Royal Institution Masterclasses, and the UNIQ Summer School. Her work is funded by the UKRI-ERC grant NAASP, focusing on new approaches to approximability of satisfiable problems.
