§ Academic
Competitive Programming
I started competitive programming in 2012, and regularly participate in contests. My team tesla_protocol qualified for the ICPC World Finals 2020, where we placed 46th.
- Codeforces: codelegend (Grandmaster, peak 2475, India #3)
- AtCoder: codelegend (peak 2171, India #10)
- Topcoder: anurudhp (peak 1885, India #5)
- CodeChef: codelegend (peak 2389)
I have also been the IIIT-H Programming Club coordinator for four years. I conducted sessions on various topics and organized some ICPC style contests.
From November 2021 till June 2022, I trained a few IIITH teams for ICPC, notably HolyTrinity and FLogic who qualified for the World Finals in 2021 (Dhaka) and 2022 (Egypt) respectively.
Theory
I co-founded the Theory Group at IIIT-H and am super enthusiastic to explore and learn theory. I planned and conducted a few activities such as Seminar Saturdays and Theory Thursdays.
Programming Languages
I like learning new languages and paradigms. I’ve learnt a good amount of Haskell and C++. I also love theorem proving languages like Coq and Lean. I’ve experimented a bit with APL.
Teaching
I really love teaching! I have conducted sessions as part of the Programming Club and Theory Club, and for school kids for Informatics Olympiad. If you have an event, hit me up, I’d be glad to teach!
§ Hobbies
I follow three sports - Football, Formula-1 and Chess. If I had to pick my favourites - Tomáš Rosický, Ayrton Senna and Vasyl Ivanchuk.
I occasionally play chess online on lichess and chess.com, for fun.
I used to be a speedcuber with an official fastest solve of 16.60 seconds.
§ Random
If I were a Springer-Verlag Graduate Text in Mathematics, I would be Saunders Mac Lane’s Categories for the Working Mathematician.
I provide an array of general ideas useful in a wide variety of fields. Starting from foundations, I illuminate the concepts of category, functor, natural transformation, and duality. I then turn to adjoint functors, which provide a description of universal constructions, an analysis of the representation of functors by sets of morphisms, and a means of manipulating direct and inverse limits.
Which Springer GTM would you be? The Springer GTM Test
Erdős has a Peduri number of four. Are you interested in finding your Peduri number? Check it out at here!
