BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CAIL//Events//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CAIL Events
BEGIN:VEVENT
UID:2026-11-06-josh-alman@cail.columbia.edu
DTSTAMP:20261103T200238Z
DTSTART:20261106T173000Z
DTEND:20261106T183000Z
SUMMARY:Josh Alman - Truly Subquadratic 3SUM and Truly Subcubic APSP via T
 riangles in Sparse Lopsided Graphs
LOCATION:CSB 453\, Computer Science Building\, 500 W 120th St\, New York\,
  NY 10027
GEO:40.809528;-73.960074
DESCRIPTION:I’ll talk about new faster algorithms for 3SUM\, APSP\, and 
 many more problems. They all follow from one new algorithm for quickly com
 puting certain entries of a matrix product. That algorithm was found by An
 thropic using an internal model of Claude. They then contacted me and Virg
 inia Vassilevska Williams to understand and properly write up the algorith
 m.\nI’ll talk about the algorithm itself\, what it means for fine-graine
 d complexity\, and the experience of being contacted by Anthropic and putt
 ing this paper together.\nPaper on arXiv: https://arxiv.org/pdf/2610.06783
 \n\nhttps://cail.columbia.edu/events/2026-11-06-josh-alman
URL:https://cail.columbia.edu/events/2026-11-06-josh-alman
END:VEVENT
END:VCALENDAR