Algorithms & Discrete Mathematics
Guided research projects about graphs, finite structures, algorithms, fairness, and scheduling.
Discrete mathematics studies objects built from separate pieces, such as graphs, networks, arrangements, and finite sets. Algorithms give precise steps for solving questions about those objects.
The projects in this area connect mathematical structure with computation. Students can study how to divide resources fairly, colour a graph, create a schedule, generate pseudorandom numbers, classify game data, or test the limits of computation. A typical project asks not only whether a method works, but why it works, how efficient it is, and where it can fail.
Expander Graphs for Pseudorandom-number Generation
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 02Fair Division, Rental Harmony, and Sperner’s Lemma
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 03Fair Allocation of Shared Resources
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 04Course Registration and School Timetabling
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 05Graph-colouring Algorithms for Scheduling
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 06Rhythm-game Difficulty Classification with Machine Learning
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 07Rubik’s Cube as a Turing-complete Computer
A guided research project in Algorithms & Discrete Mathematics.
Open project page → 08Busy Beaver Computation Using Quantum Algorithms
A guided research project in Algorithms & Discrete Mathematics.
Open project page →