Hi there!

I am Santhoshini, a second-year theoretical computer science graduate student at Harvard University, advised by Prof. Madhu Sudan. I am broadly interested in algorithms and optimization. My recent research works include 1) the design of first approximately revenue-optimal non-truthful multi-item auctions, 2) a unified approach to obtain optimal streaming approximation algorithms for Boolean constraint satisfaction problems, and 3) the design of nearly-optimal efficient adaptive data structures for the set membership problem in the bit-probe model by a novel use of error-correcting codes.

In my leisure, I enjoy solving problems from past IMO papers. I also love playing NY Times Spelling Bee.