Bloom, Lubell, and Rubenfeld
Type: Person
As of November 2026, Bloom, Lubell, and Rubenfeld has been mentioned in one podcast episode on Institute for Advanced Study (Jan 2026). Cited for a classic worst-case to average-case reduction for matrix multiplication over finite fields, used as a motivating example for the speaker’s cryptography-based speedups.
Researchers (paper authors; exact titles not specified in transcript) at Not specified in transcript (likely academic authors; ambiguous identification) specializing in theoretical computer science, property testing, probabilistically checkable proofs / linearity testing (BLR-style results)
| Mentioned in | 1 episode on 1 podcast (as of November 2026) |
|---|---|
| First heard | Jan 2026 on Institute for Advanced Study |
| Role | Researchers (paper authors; exact titles not specified in transcript) |
| Affiliation | Not specified in transcript (likely academic authors; ambiguous identification) |
Who talks about Bloom, Lubell, and Rubenfeld on podcasts?
Bloom, Lubell, and Rubenfeld came up; the most recent mention was Jan 2026 on Institute for Advanced Study.