< hello world, this is >
▍
Computer Science graduate from the University of Waterloo, starting my MSc in Computer Science at the University of Toronto under Prof. Niv Dayan — building faster data systems, compilers, and algorithms.
I'm Aryan Vahabpour. I fell in love with computers in middle school — first writing little Python games, then training as a competitive programmer through high school: graph theory, algorithms, data structures and combinatorics across Codeforces, LeetCode, DMOJ and the Informatics Olympiads.
I graduated from the University of Waterloo with a Bachelor of Computer Science — Dean's Honours, a minor in Combinatorics & Optimization and a Co-operative Education in Research certificate (93.88 major average). Along the way I researched approximation algorithms with Prof. Chaitanya Swamy and co-authored an IPDPS 2025 paper on polyhedral compilers.
This fall I begin my Master of Science at the University of Toronto, supervised by Prof. Niv Dayan, researching high-performance data systems and storage engines.
Supervised by Prof. Niv Dayan, researching high-performance data systems and storage engines.
Dean's Honours · minor in Combinatorics & Optimization · Co-operative Education in Research certificate. 93.88 major average.
On the CoCo cabin team alongside BlueAI. Designed a RAG architecture in n8n to review pull requests against internal requirements, built and trained an MCP server in Kotlin running on Ford's in-car chip, and rebuilt the climate-panel UI for new Ford vehicles in Kotlin with C++ functionality.
Full-time research on approximation algorithms under Prof. Chaitanya Swamy. Found new O(log n) approximation algorithms for a load-balancing problem under Monotone Symmetric Norms and proved their optimality assuming P ≠ NP.
On the Polyhedral Optimization project, building PolyTool — a polyhedral optimizing compiler in C++ on MLIR. Optimized AI kernels by 20% over the state of the art and filed a primary-inventor patent on a core algorithm.
ISA for Object-Oriented Software Development (Enriched), taught by Brad Lushman. Office hours on C++20, OOP and design patterns; marked the final VIM & game-engine projects.
Designed an efficient algorithm to identify tie-down positions and build tie-down systems per CWC physical rules; shipped it for the 2023 Beta of Shearwalls using C++ and MFC.
ISA for Elementary Algorithm Design & Abstraction (Advanced), taught by Brad Lushman. Ran pre-exam reviews for ~100 students; office hours on C, Racket and Hoare logic.
Built the Recall feature across statistical tools in SigmaXL 9.11 and DiscoverSim 2.25 (VBA), and shipped new tools like Heatmap and Tally for SigmaXL 10.
IEEE IPDPS 2025 · Milano, Italy — Best-Paper nominee · 24.7% acceptance rate
A solo-built iOS app that helps readers remember the books they've read by surfacing personalized daily insights from their own library. Expo / React Native + TypeScript front end, Convex serverless backend with timezone-aware push, and an OpenAI Responses-API pipeline with prompt-injection defenses and source-attribution validation.
A friendly ASCII game engine in C++. I rebuilt classics — Break Out, Space Invaders and an ASCII escape room — on top of it, applying SOLID principles, design patterns and UML.
Generates images, songs and videos using Cohere, Groq, Suno and DALL·E 3. Built with a team of four in 32 hours at Hack the North 2024 — I owned the Flask + MongoDB backend.
Full-stack Kotlin app helping students plan their degree against checklists and prerequisites. We parsed 4000+ Waterloo courses at 97%+ accuracy and used maximum matching to maximize satisfied requirements.
Click a card to flip it
What's next?
Open to research collaborations, internships and a good conversation about data systems.
aryanvahabpour@gmail.com
