Awards & Prizes
Machine Learning
Discrete Optimization
- 4-time finalist (2015 - Indianapolis, 2016 - Washington D.C., 2017 - Buffalo, 2020 - TBA)
in the Topcoder Open for the Marathon Track
- 2017 site.
The Marathon Track of the Topcoder Open is one of the biggest discrete
optimization challenges in the world, with over 500 participants at the start.
Contestants are asked for approximate solutions to NP-Hard problems, over a 2 week time span.
Algorithms used include Local Search based
(Simulated Annealing, Tabu Search, Guided Local Search).
and Search based (Beam Search, A*)
- Example competition for the 2016 final qualification (1st place) - topcoder link
- Editorial I wrote for one of the rounds - topcoder link
- Rank 6 in the Marathon Track rating on TopCoder - profile page
Algorithm contests
- 9th place out of 10724 teams in the Google Hash Code 2020 world finals - with Team Marathoners, online
- 21th place out of 1054 teams in the Google Hash Code 2016 world finals - with Team LonelyDogs, Paris
- Google Code Jam 2006 finalist - top 50, New York City - results
- USAICO 2006 finalist - after the performance in USACO , Colorado Springs
Fulbright Scholarship