Itcs 2022 Session 1

Summary

Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ... Chair: Mahsa Derakhshan Dynamic Matching Algorithms Under Vertex Updates Hung Le (University of Massachusetts); Lazar ... Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Yang Cai Maximizing revenue in the presence of intermediaries Gagan Aggarwal, Kshipra Bhawalkar Lane, Guru ... Chair: Ken Clarkson Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing Nikhil Bansal (University of ... Chair: Antonina Kolokolova PCPs and Instance Compression from a Cryptographic Lens Liron Bronfman and Ron Rothblum ... Chair: Alex Grilo The importance of the spectral gap in estimating ground-state energies Abhinav Deshpande and Alexey V. Chair: Karthik C. S. Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett (Oregon State University); Chris ... Chair: Aditya Bhaskara Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions ... Chair: Raghuvansh R. Saxena Keep That Card in Mind: Card Guessing with Limited Memory Boaz Menuhin and Moni Naor ... Chair: Noga Ron-Zewi Nonlinear Repair Schemes of Reed-Solomon Codes Roni Con and Itzhak Tamo (Tel Aviv University) ... Chair: Xue Chen Probing to minimize Weina Wang, Anupam Gupta, and Jalani Williams (Carnegie Mellon University) Double ... Chair: Maryam Aliakbarpour Testing Distributions of Huge Objects Oded Goldreich (Weizmann Institute of Science); Dana Ron ...