معرفی
Silvia Butti is a Senior Research Associate at the University of Oxford's Department of Computer Science and holds a Junior Research Fellowship at Lady Margaret Hall. Her research focuses on theoretical computer science, particularly constraint satisfaction problems (CSPs), algorithms, and complexity theory. She collaborates with Standa Živný on projects funded by the UKRI-ERC grant NAASP. She earned a PhD from Universitat Pompeu Fabra, an MSc in Mathematics and Foundations of Computer Science from Oxford, and a BSc from University College London.
Her work bridges algebraic methods and computational complexity, exploring topics like promise CSPs, hierarchies (e.g., Sherali-Adams, Weisfeiler-Leman), and approximation algorithms. She has been awarded the INPhINIT fellowship and Marie Skłodowska-Curie COFUND funding. She has taught courses on Combinatorial Optimization, Computational Complexity, and Probability and Computing at Oxford, and Discrete Mathematics at UPF.
Butti actively participates in academic outreach, including Maths Fest and Royal Institution Masterclasses, and has presented her research globally at venues like ICALP, LICS, and STACS. Her contributions span theoretical advancements and collaborative projects, with a focus on solving foundational challenges in computational complexity.
