MFoCS Student Profiles and dissertation titles
Hayyu Imanda
"MFoCS has been extremely challenging but nevertheless truly stimulating and rewarding."
Hayyu Imanda (Inda) 2016-17
I grew up in Indonesia, before I moved to the UK to do my undergraduate degree in mathematics. At the time, I became interested in the interaction between pure mathematics other other fields; I was also deliberating between career in academia or industry, and doing MFoCS would open many doors in all respects.
The assessment method in MFoCS is unique — within the 3 weeks of working on mini projects each term, it is almost inevitable to discover an entirely new domain on each subject outside the course syllabus, due to the open-ended nature of some problems. It is then summed up with a dissertation, on our choice of topic, and getting to spend the Summer in Oxford is a plus!
What I’ve enjoyed most throughout my year is being a part of a vibrant MFoCS cohort of extremely bright and motivated individuals, of many different mathematical interests. Throughout the year, I have learned a lot — academically and personally — from and alongside the cohort, as well as other students in college and the two departments, and have made very special friends along the way. Lastly, a significant part of my year was spent playing for the tennis Blues team, which adds a competitive edge and a beautiful dynamic to university life.
MFoCS has been extremely challenging but nevertheless truly stimulating and rewarding. All in all, my experience in Oxford has been nothing but spectacular.
Shreyas Srinivas
"I... had the privilege of having great supervisors for my coursework and dissertation, whose guidance has been invaluable."
Shreyas Srinivas 2016-17
I'm Shreyas, an MFoCS student with interests in computational complexity and related areas. I applied to MFoCS because it was uniquely well-suited to my goal of getting into research in CS theory. The course does not require you to study any pre-determined set of subjects, in particular courses in non theoretical areas of Computer Science. This has helped me shape my own unique path through the course. Also, the concept of examination through mini projects instead of sit-in exams appealed to me when I was applying. My experience throughout the course has validated my expectations. I have learnt a lot through the courses, mini projects and the dissertation. I have also had the privilege of having great supervisors for my coursework and dissertation, whose guidance has been invaluable. The unconventional one year duration of the course has been helpful too. I have been able to secure an year long research-based internship while I apply for PhD programmes. All in all the course has been quite intense and enjoyable.
Students' Past Dissertations
2020–2021
| Synthesising Reward Automata for Reinforcement Learning Using Hidden Markov Models |
| Random temporal and edge-ordered graphs |
| Enriched Category Theory, Generalised Logic, and Homotopy Type Theory |
| Community detection in Multilayer Networks using Multiplex Markov Chains |
| On the Verge to Improve Technique of T-count Reduction via Spider Nest Identities |
| The Echo Chamber Effect on Twitter in the COVID-19 Vaccine Debate |
| Colimit computations for diagrams of vector spaces |
| Preprocessing in Inductive Logic Programming |
| Single-peaked preferences: identifying axes from samples |
| Embedding Graphs in Banach Spaces |
| Transfinite game values in infinite games |
| Lascar Groups and the Fundamental Groups of a First-Order Theory |
| Computer Verification of Combinatorics Constructions and Theorems |
| Splitting Theory of Groups |
| Max-Cut: Local Search and Smoothed Analysis |
| Reconstruction problems in Combinatorics |
| Safety During Training in LTL-Guided Reinforcement Learning |
| The Arithmetic of Elliptic Curves and Jacobians of Genus 2 Curves |
| Information Propagation in Deep Neural Networks with Drop-out |
| Feynman Diagrams in Categorical Quantum Mechanics” |
| Multi-Agent Reinforcement Learning with Temporal Logic Specifications under Uncertainty |
2021–2022
|
S-unit attacks on structured lattice-based cryptosystems |
|
Undoubling the ZX-calculus Classical Simulation of Quantum Circuits |
|
Deformation Theory of Galois Representations |
|
Slow mixing of the edge dynamics in the Potts model on random regular graphs |
|
Louvain and Leiden: Investigating Modularity-Based Community Detection |
|
Sparsification of Submodular Functions |
|
Graphical Stabilizer DecompositionsFor Counting Problems |
|
Chromatic number of triangle-free graphs |
|
Some Model Theoretic Results for Set Theory |
|
Dynamics of optimal group testing strategies for COVID-19 |
|
Generating random supersingular Elliptic Curves using modular polynomials |
|
Notions of Agreement and Disagreement in Social Choice |
|
Qudit ZH-Calculus |
|
Clonal Interference: Efficiently Approximating Fixation Probabilities in the Moran Process with Multiple Types |
|
General Spin Systems on Bipartite Graphs with Unbounded Degree |
|
Switchings in configuration model, with |