Past/upcoming invited talks on streaming approximability of CSPs:
- "Not-so-local local algorithms'', an online talk series on sublinear algorithms, Jun 2022.
- University of Michigan theory seminar, Mar 2022.
- MIT theory seminar, Dec 2021.
- Google algorithms seminar, Nov 2021.
- Purdue theory seminar, Oct 2021.
- Stanford theory lunch, Jul 2021.
- TCS+ talk , May 2021.
- Rutgers theory seminar, Mar 2021.
Other talks:
1. Simple, credible and approximately-optimal auctions, 2020 - Lightning talk video (1-minute) | Full-talk (18-minutes)
2. Improved explicit data structures in the bit-probe model using error-correcting codes, 2020 - talk (20-minutes)