Media Summary: Mitali Bafna (Harvard), Max Hopkins (UCSD), Tali Kaufman (Bar Ilan University) and Shachar Lovett (UCSD) Tom Gur (University of Warwick), Noam Lifshitz (Hebrew University of Jerusalem) and Siqi Liu (UC Berkeley) Directed flow-augmentation Eun Jung Kim (Université Paris-Dauphine, PSL Research University, CNRS), Stefan Kratsch ...
Stoc 2022 Hypercontractivity On High Dimensional Expanders - Detailed Analysis & Overview
Mitali Bafna (Harvard), Max Hopkins (UCSD), Tali Kaufman (Bar Ilan University) and Shachar Lovett (UCSD) Tom Gur (University of Warwick), Noam Lifshitz (Hebrew University of Jerusalem) and Siqi Liu (UC Berkeley) Directed flow-augmentation Eun Jung Kim (Université Paris-Dauphine, PSL Research University, CNRS), Stefan Kratsch ... Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs are not Unique Neighbor Nati Linial, Hebrew University of Jerusalem Speaker Max Hopkins (University of California, San Diego) Date : 9th Sep
Title: Byzantine Agreement in Polynomial Time with Near-Optimal Resilience Authors: Shang-En Huang (University of Michigan), ... Title: Computational Complexity of the Ground State Energy Density Problem Authors: James D. Watson (University College ... The Query Complexity of Certification. Guy Blanc (Stanford University), Caleb Koch (Stanford University), Jane Lange (MIT) and ... Talk by Inga Valentiner-Branth (Ghent University), at the Antwerp Algebra Colloquium on February 24, 2023. The Shortest Even Cycle Problem is Tractable Andreas Björklund (Lund, Sweden), Thore Husfeldt (Lund University and Basic ... Rate One-Third Non-malleable Codes Divesh Aggarwal (National University of Singapore), Sruthi Sekar (UC Berkeley, California) ...
Locality-Sensitive Orderings and Applications to Reliable Spanners Arnold Filtser (Bar-Ilan University) and Hung Le (University of ... Max Hopkins (UC San Diego) Analysis and TCS Boot ... The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ... Maintaining Exact Distances under Multiple Edge Failures Ran Duan (Tsinghua University) and Hanlin Ren (University of Oxford) Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism. Sam Hopkins (UC ... Matrix anti-concentration inequalities with applications Zipei Nie (Lagrange Mathematics and Computing Research Center)
