5 januari 2026
58 min
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
Today Xiao Mao joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!
Lyssna på fler avsnitt från
Boston Computation Club
Visar 1–10 av 84 avsnitt
3 juli 2026
06/26/26: Tracing Introspection Across Model Depth, Zach Maas
48 min
18 april 2026
An Extremely Short Proof of the Hairy Ball Theorem with Peter McGrath
58 min
9 mars 2026
Logic.py: Bridging the Gap between LLMs and Constraint Solvers with Pascal Kesseli
57 min
18 februari 2026
2/17/26: Approximately Aligned Decoding with Daniel Melcer
49 min
7 februari 2026
02/06/26: Early experiments in FMxAI at Galois with Max von Hippel
54 min
17 januari 2026
VeriExploit: Automatic Bug Reproduction in Smart Contracts via LLMs and Formal Methods, Chenfeng Wei
42 min
15 september 2025
Infecting Generative AI with Viruses - David A. Noever and Forrest McKee
60 min
15 augusti 2025
08/15/25: An LLM Agent for Functional Bug Detection in Network Protocols with Mingwei Zheng
57 min
2 augusti 2025
08/01/25: Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification with Kaiyu Yang
74 min
25 juli 2025
07/25/25: RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types with Michael Sammler
52 min