Some selected talks:

1. Improved Bounds for Perfect Sampling of k-Colorings in Graphs:

   • STOC 2020 (Extended Version by Sayantan Chakraborty here)

   • CMU Theory Lunch-Fall 2019

2. Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel:

   • JTG summer school (Invited Talk), IIT Bombay, 2018

   • Student Paper Award Finalists' session at the International Symposium of Information Theory, Jun 2018, CO, USA.