Irit Dinur (Irit Dinur), Venkat Guruswami (venkatguruswami ) and I are organizing a 2-week program on HDX and Codes at ICTS-TIFR, Bengaluru, India (ICTS). See attached poster for more details and how to apply for the program. icts.res.in/program/HDXand…

Gil Cohen gave a fabulous mini-course on analytic approaches to spectral graph theory and Ramanujan graphs. Highly recommended! The lectures are available in the link below. youtube.com/playlist?list=…

An exciting result has just appeared on arXiv, concerning the following simple-seeming problem: if A is a set of n positive integers, then how large a sum-free subset B must it contain? That means that if x, y and z belong to B, then x + y should not equal z. 🧵

I've enjoyed this excellent exposition of the recent progress in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes by Garg, Prahladh Harsha , Kumar, Saptharishi, and Shankar. A fascinating read. arxiv.org/pdf/2502.14358…

What are some recommended resources to get into algebraic complexity theory? Any recommendations for video lectures, lecture notes, surveys, or books would be much appreciated.

On Wednesday (19 March) at 5pm UK time, I'll be giving an online talk at TCS+ about my recent work, "A Zero Knowledge PCP Theorem", joint with Nick Spooner and Jack O'Connor. See more details here: tcsplus.org

Prakash Murali and I are seeking to jointly recruit a postdoctoral researcher (Dowling fellow) at Cambridge to conduct research in quantum algorithms, complexity, error correction, and architecture. Further details: jobs.cam.ac.uk/job/50485/ Deadline: 7 April 2025

Sylvester, Gallai and Friends: Discrete Geometry Meets Computational Complexity — a fantastic new talk by Avi Wigderson about Sylvester–Gallai theorems and their connections to Computer Science. youtu.be/VJ-d1jPc1YM?si…

Natalie Natalie Parham has some bold new ways of proving quantum circuit lower bounds, with fascinating connections to condensed matter physics and the natural proofs barrier from complexity theory. There are some really interesting questions to explore here.

CCC’25 will take place August 5-8 at the Fields Institute in Toronto! Students/postdocs (from any institution) are eligible to apply for a travel allowance. For full consideration, please apply by June 20; awards to be announced on June 25. computationalcomplexity.org/travelAllowanc…

Recently came across this fantastic talk by Clément Canonne (on Blue🦋Sky) on deterministic amplification via expander graphs—elegant ideas, crystal-clear exposition. A real gem! youtube.com/watch?v=3AAUqW…

Hirahara, Illango, and Loff posted on the arXiv a lovely result, showing that determining the communication complexity of a function f is NP-hard. A fundamental question first asked by Yao in '79. The proof is very clean and elegant. A fun read! arxiv.org/pdf/2507.10426…

After 78 years, an exponential improvement for Ramsey numbers were found by Jie Ma, Wujie Shen, and Shengjie Xie. gilkalai.wordpress.com/2025/07/23/ama…

📢The Workshop Algorithms & Complexity @ Warwick will be held on 22-23 September at the University of Warwick! The event will highlight several recent exciting advances in the field of Algorithms and Complexity. Looking forward to seeing many of you there! sites.google.com/view/algorithm…

An excellent resource from MIT OpenCourseWare : Yael Tauman Kalai's lecture series on "Advanced Topics in Cryptography." A thorough and engaging blackboard course for anyone studying the field. ocw.mit.edu/courses/6-5630…