Research.
Algorithms, graph theory, and the pleasure of finding a simpler way to think about something difficult.
Lorem Ipsum Dolor Sit Amet Consectetur
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.
Taking games seriously
I spoke about combinatorial games and Grundy theory: how a complicated game can sometimes be understood through one small mathematical object.
A chance to take an idea out of the notebook and work through it with a room full of curious people.
A week at Waterloo
Eighth place in Canada, a CCO silver medal, and an invitation to Canada’s IOI selection camp. More than the results, I remember the people who enjoyed getting stuck on the same problems.
Where it started
Before research, there were olympiads: a bronze medal in the 2023 Iranian Olympiad in Informatics and silver in the Iranian Combinatorics Olympiad.
Long afternoons with a problem, a blank page, and friends who kept asking one more question.
“The greatest enemy of knowledge is not ignorance, it is the illusion of knowledge.”Stephen Hawking