Robin Kothari

robinkothari.bsky.social

16 October 2026 12:55

I'm honored and excited to announce that this paper was selected to receive a Best Paper Award at FOCS 2026! Thanks to my coauthors Matt, Daochen, and Rain for including me in this work, and to the FOCS PC for selecting this despite it having a simple proof.

FOCS 2026

focs2026.bsky.social

16 October 2026 12:55

Travel Scholarships for #FOCS2026 by TCS For All! "For researchers at the beginning of their careers. This scholarship is being made available for all students in TCS. This scholarship is open to both US and international students." Apply by ⏰ October 22: sigact.org/tcsforall/fo...

Rasmus Pagh

rasmuspagh.net

08 October 2026 15:03

I have known about this result for about 3 years, but since Thomas and Jakob are working in industry it took some time to get the paper written. A nice contrast to the rush to publish that we see too often, and as a bonus the paper is (partly) Lean formalized. Congratulations on this achievement!

Rasmus Pagh

rasmuspagh.net

08 October 2026 15:02

In a new result published on arXiv, former BARC PhD students @thomasahle.bsky.social and Jakob Bæk Tejs Houen make great progress on this question: floor(n/2)+1 multiplications suffice for any n. Great to see progress on a classic problem with such a clean result! arxiv.org/abs/2609.06022

Jeremy Kun

jeremykun.com

08 October 2026 00:58

Relevance to whom?