All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method, with Sepehr Assadi and Aaron Bernstein.ITCS 2023.
I am a third-year PhD student at Rutgers University, advised by Aaron Bernstein. I am broadly interested in theoretical computer science and combinatorics, and my research is mainly focused on the design and analysis of algorithms.
Before coming to Rutgers in 2019, I worked as a software engineer for six years at various companies, most recently on the bioinformatics team at Color. I obtained my B.S. in computer science from RIT in 2013.
A framework for dynamic matching in weighted graphs, with Aaron Bernstein and Aditi Dudeja.STOC 2021.
Improved bounds for distributed load balancing, with Sepehr Assadi and Aaron Bernstein.DISC 2020. Best Paper Award.
Minimum planar multi-sink cuts with connectivity priors, with Ivona Bezáková.MFCS 2014.
Contiguous minimum single-source-multi-sink cuts in weighted planar graphs, with Ivona Bezáková.COCOON 2012.
Algorand, Smart Contracts Researcher. May 2021–August 2021, Jan 2022–Present.
Color Genomics, Software Engineer, Jul 2017–Jul 2019.
Expa, Developer-in-Residence, Feb 2017–Jun 2017.
Operator, Software Engineer, Apr 2015–Dec 2016.
Twitter, Software Engineer, Sep 2013–Apr 2015.
Google, Software Engineer — Intern, May 2013–Aug 2013.