Published “From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework” in ICAART at the AMISTAD Lab under Prof. George doi.org/10.5220/0012370600003636
Competitive Programming
ICPC NAC-NAPC (Top 50 USA), 3rd Place at C1 Terminal, American Computer Science League Finalist
Computational Chemistry Research
Designed coarse-graining algorithms for molecular dynamics simulations under Prof. Loverde
Backgammon Research
Developed optimal backgammon strategies under world champion Arthur Benjamin.
Other Competitions
1st Place @ Hacklytics NSA Cybersecurity Challenge, 2x 1st Place at Citadel West Coast Datathon, 1st Place @ 5C Datathon, Nationwide Finalist at the Modeling The Future Challenge
