Media Summary: Chair: Aditya Bhaskara Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions ... Chair: Omri Ben-Eliezer Noisy Boolean Hidden Matching with Applications Michael Kapralov (EPFL); Amulya Musipatla (CMU); ... Chair: Eylon Yogev On the download rate of homomorphic secret sharing Ingerid Fosli (Stanford/Google); Yuval Ishai and Victor I.
Itcs 2022 Session 11 - Detailed Analysis & Overview
Chair: Aditya Bhaskara Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions ... Chair: Omri Ben-Eliezer Noisy Boolean Hidden Matching with Applications Michael Kapralov (EPFL); Amulya Musipatla (CMU); ... Chair: Eylon Yogev On the download rate of homomorphic secret sharing Ingerid Fosli (Stanford/Google); Yuval Ishai and Victor I. Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... Chair: Ariel Schvartzman Individual Fairness in Advertising Auctions through Inverse Proportionality Shuchi Chawla (UT Austin); ... Chair: Josh Alman Polynomial Identity Testing via Evaluation of Rational Functions Dieter van Melkebeek and Andrew Morgan ...
Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Nicole Wein A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben (Royal Holloway, ... Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ... Chair: Raghuvansh R. Saxena Keep That Card in Mind: Card Guessing with Limited Memory Boaz Menuhin and Moni Naor ... Chair: Xue Chen Probing to minimize Weina Wang, Anupam Gupta, and Jalani Williams (Carnegie Mellon University) Double ... 13th Innovations in Theoretical Computer Science Conference (
