Our SIGMOD 2018 paper has won the Most Reproducible Paper award to be awarded during SIGMOD 2019.
We are organizing 2nd TCS (Theoretical Computer Science) Women Meeting at STOC 2019. We will be providing travel scholarships to women students to attend STOC. The application deadline is April 25th, 2019.
I am honored to be named as a Sloan Fellow. For more details see here, here, here and here.
Organizing
Fine-grained Approximation Algorithms & Complexity Workshop at Bertinoro, May 27-31, 2019
Inaugural TCS Women meeting at STOC 2018 Theory Fest. Scholarships available for women graduate students to attend STOC.
Data Center Scheduling Workshop at TTIC July 30-Aug 2nd.
An invited session on new directions in clustering at Allerton 2018
Program Committee
Upcoming: SODA 2020, ESA 2019, APPROX 2019, FSTTCS 2019.
Recently Completed: STOC 2019, ALENEX 2019, ICALP 2018, SWAT 2018, ICML 2018, ICLR 2018 and WWW 2018.
Recent Invited Talks
-External Invited Speaker, Capital Area Theory Day
-Distinguished Theory Seminar, Boston University
-Highlights of Algorithms, 2018 Survey talk
-Approximation Algorithms & Networks Symposium at College-de-France
-Summer School of Prague on Algorithms and Lower Bounds 2018
-Women in Theory Workshop
and more..
FND workshop at UMD, Dagstuhl Seminar on Scheduling, Colloquium/Theory seminars at Stanford, UC Berkeley, UCSD, USC, Georgia Tech, Institute for Advanced Study, University of Michigan and MIT .
Check out new papers at KDD'19, STOC'19, IPCO'19.
Check out my recent paper in FOCS'17 to learn about amnesic dynamic programming.
Received NSF CAREER on Efficient Fine-grained Algorithms. Thanks NSF!
Board talk at Simons on our FOCS'16 paper.
Seminars at Rice University, Harvard and UMD on Language Edit Distance & (min,+)-matrix multiplication
New preprint on arxiv Clustering via Crowdsourcing
Received a Google Faculty Research Award for my proposal ``Mining Structures in Massive Networks''. Thanks Google!
Talk at ITA on RNA Folding--breaking the cubic barrier--the first improvement after Nussinov's 1980 algorithm through the lens of Language Edit Distance.
Significant Bits article on Dilemmas of Algorithm Design.
Talk video from The Simons Institute.
New paper on crowd-sourced entity resolution with Divesh Srivastava and Donatella Firmani got accepted to PVLDB Vol9/ VLDB 2016!
Talk at The Simons Institute workshop on Computational Complexity of Low Polynomial Time Problems.
Thanks to Yahoo! for 2015 Academic Career Enhancement Award!
Serving as a Guest Editor for the Transactions of Algorithms Special Issue of SODA 2016.
Colloquium Talks at UCSB and USC on Randomization in Data and Design.
Presented my paper on Language Edit Distance at FOCS 2015, Berkeley, California.
Talk at MIT Algorithms & Complexity Seminar
Thanks to NSF for my first grant, and for the NSF CRII Award!
Received Simons Research Fellowship for Fall 2015.
New paper on Faster Algorithms for Language Edit Distance and Stochastic Grammar Parsing accepted to FOCS 2015!
Video of my FOCS 2014 talk.
