2026-2027

2026/10/21: Rachel Yun Zhang, "Linear Time Encodable Quantum Error-Correcting Codes"

2026/9/30: Sepehr Assadi, "Greedy is Optimal for the Semi-Streaming Matching Problem"

2026/09/16: Tselil Schramm, "10 years of the low-degree framework in average-case complexity"

2026/10/21: Rachel Yun Zhang, "Linear Time Encodable Quantum Error-Correcting Codes"

Rachel Yun Zhang (UC Berkeley)

2026/9/30: Sepehr Assadi, "Greedy is Optimal for the Semi-Streaming Matching Problem"

Sepehr Assadi (University of Waterloo)

2026/09/16: Tselil Schramm, "10 years of the low-degree framework in average-case complexity"

Tselil Schramm (Stanford University)

Page updated

Google Sites

Report abuse