Research.
Taking courses helps me understand what’s already known. Research pushes me to contribute something new, even if that means sitting with an open problem long before I know how to solve it. I’m learning to keep going when the voice in my head says it’s impossible.
Space-Efficient Hierholzer for Undirected Graphs
How little memory do you need to walk every edge of a graph exactly once? Our work extends a space-efficient Euler-tour algorithm to undirected multigraphs. Submitted to SOSA 2027.
Work in progress
Lorem Ipsum Dolor Sit Amet Consectetur
Grundy Numbers
At CUMC, I gave a talk on Grundy numbers and combinatorial games, exploring how a complicated game can sometimes be understood through a single number. It was a chance to share the ideas behind the theory and work through them with a room full of curious people.
Olympiads
At CCO, I placed eighth in Canada, earned silver, and received an invitation to Canada’s IOI selection camp. The best part was getting to know so many legendary people and the way they approach problems.
Good Old Days
Some of my favourite memories began with a difficult problem and friends who refused to leave it alone. Preparing for the Iranian Olympiads led to a bronze medal in Informatics in 2023 and silver in Combinatorics, but I remember the long afternoons, shared ideas, and excitement of finally finding a solution just as clearly.
“The greatest enemy of knowledge is not ignorance, it is the illusion of knowledge.”Stephen Hawking