2026
- Criticality of Johan: Switching Lemma to Correlation Bounds, Celebration of Complexity (in honor of Johan Håstad), The Royal Academy of Sciences, Stockholm, Sweden, 12 June. [ slides | program ]
- An introduction to quantum error correction, Coding Theory Day @ UCPH, University of Copenhagen, Copenhagen, Denmark, 8 June.
- List-decoding of Reed-Solomon Codes and variants in near-linear time, WACT 2026, University of Copenhagen, Copenhagen, Denmark, 4 June. [ slides | video | program ]
- Nearly Linear-Time Decoding of Reed-Solomon Codes and Their Variants, SCDLDS Colloquium, Safexpress Centre for Data, Learning and Decision Sciences, Ashoka University, Sonepat, Haryana, 12 May. [ slides ]
- Fast list-decoding and list-recovery of univariate multiplicity and FRS codes, CSE Department Colloquium, IIT Palakkad, Palakkad, Kerala, 26 March. [ slides ]
2025
- Fast list-decoding and list-recovery of univariate multiplicity and FRS codes, MFO Workshop on 'New Mathematical Directions in Coding Theory', Oberwolfach, Germany, 8 September. [ slides ]
- Dot-Product Proofs, CSE Department Colloquium, IIT Delhi, Delhi, 28 July. [ slides ]
- The cost of communication, ICTS Workshop on HDXs and Codes, ICTS Bangalore, Karnataka, 28 April. [ program ]
- An Improved Line-Point Low-Degree Test, Dagstuhl Seminar on 'Computational Complexity of Discrete Problems', Schloss Dagstuhl, Germany, 10 March. [ program ]
- The amazing power of divide-and-conquer algorithmic paradigm, STEMS 2025, Chennai Mathematical Institute (CMI), Chennai, Tamilnadu, 7 February. [ slides | video | program ]
- The amazing power of divide-and-conquer algorithmic paradigm, Student interaction, NIT Trichy, Tiruchirappali, Tamilnadu, 26 January. [ slides ]
- Recent Advances in List-Decoding Polynomial Codes, Complexity Theory Update Meeting 2025, Institute of Mathematical Sciences (IMSc), Chennai, Tamilnadu, 23 January. [ program ]