Media Summary: Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ...
Itcs 2022 Session 1 - Detailed Analysis & Overview
Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ... Chair: Aditya Bhaskara Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions ... Chair: Mahsa Derakhshan Dynamic Matching Algorithms Under Vertex Updates Hung Le (University of Massachusetts); Lazar ... Chair: Yang Cai Maximizing revenue in the presence of intermediaries Gagan Aggarwal, Kshipra Bhawalkar Lane, Guru ...
Chair: Alex Grilo The importance of the spectral gap in estimating ground-state energies Abhinav Deshpande and Alexey V. Chair: Makrand Sinha Mixing of 3-term progressions in Quasirandom Groups Amey Bhangale (University of California, Riverside, ... Chair: Karthik C. S. Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett (Oregon State University); Chris ... Chair: Nicole Wein A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben (Royal Holloway, ... Chair: Eylon Yogev On the download rate of homomorphic secret sharing Ingerid Fosli (Stanford/Google); Yuval Ishai and Victor I. Chair: Omri Ben-Eliezer Noisy Boolean Hidden Matching with Applications Michael Kapralov (EPFL); Amulya Musipatla (CMU); ...
