Stanford CS 269I (Incentives in Computer Science) taught by Prof. Aviad Rubinstein (Winter 2026)
Stanford CS 161 (Design and Analysis of Algorithms) taught by Prof. Aviad Rubinstein (Fall 2024)
Stanford MS&E 211DS (Introduction to Optimization: Data Science) taught by Prof. Amin Saberi (Winter 2025)
AddisCoder 🧡 taught by Prof. Jelani Nelson (Summer 2025) Check this out! And if teaching in Ethiopia interests you, APPLY!
A Random Walk through Probabilistic Graph Theory Honors Thesis submitted to the Stanford Department of Mathematics, advised by Tselil Schramm
Tackling the Traveling Salesman Problem with Graph Neural Networks Blog post published as part of Stanford course CS224W (Machine Learning with Graphs) by Jure Lescovec
Optimization Methods for Graphs: Thresholds, Matchings, and Dense Subgraphs Tutorial submitted as part of Stanford course EE 364B (Convex Optimization II)
I gave quite a lot of presentations lately (mainly for CS 331X: AI for Algorithmic Reasoning and Optimization taught by Prof. Ellen Vitercik and MS&E 319: Matching Theory taught by Prof. Amin Saberi): Incentive Aware Machine Learning: Robustness with(out) predictions, Thickness and Information in Dynamic Matching Markets, Learning to design voting rules, Unintended Memorization in Neural Networks, (Primal Dual) Neural Algorithmic Reasoning, In-Context Learning: Literature Review, Optimal Stopping with Predictions, Optimizing Solution-Samplers for Combinatorial Problems...
More (from undergraduate): Semi-direct products, Arzela Ascoli Theorem