Past/upcoming invited talks on streaming approximability of CSPs:

1. Sketching and Algorithm Design workshop at Simons Institute, Oct 2023 - talk video
2. Cornell's Junior Theorists' workshop, May 2023
3. Georgetown University Theory seminar, Mar 2023
4. Boston University Algorithms and Theory seminar, Oct 2022
5. Sydney Algorithms and Computing Theory, Oct 2022 

   Very clear and nice talk at #USydCompSci by @Santho_Velusamy on her work(s) on approximating CSPs in the streaming setting.
   
   Pretty sharp threshold behaviour: either you can approximate the number of satisfied constraints in log space, or you need polynomial space! pic.twitter.com/MiOaeewclA

   — Clément Canonne (@ccanonne_) October 25, 2022

6. Northeastern University theory seminar, Oct 2022
7. "Not-so-local local algorithms'', an online talk series on sublinear algorithms, Jun 2022
8. University of Michigan theory seminar, Mar 2022
9. MIT theory seminar, Dec 2021
10. Google algorithms seminar, Nov 2021
11. Purdue theory seminar, Oct 2021
12. Stanford theory lunch, Jul 2021
13. TCS+ talk , May 2021
14. Rutgers theory seminar, Mar 2021

Recorded conference 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)

3. Sketching Approximability of Weak Monarchy Predicates, 2022 - talk (20 minutes)