Media Summary: Chair: Karthik C. S. Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett (Oregon State University); Chris ... Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Ken Clarkson Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing Nikhil Bansal (University of ...
Itcs 2022 Session 6 - Detailed Analysis & Overview
Chair: Karthik C. S. Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett (Oregon State University); Chris ... Chair: Gautam Kamath 13th Innovations in Theoretical Computer Science ( Chair: Ken Clarkson Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing Nikhil Bansal (University of ... Chair: Raghuvansh R. Saxena Keep That Card in Mind: Card Guessing with Limited Memory Boaz Menuhin and Moni Naor ... Chair: Yang Cai Maximizing revenue in the presence of intermediaries Gagan Aggarwal, Kshipra Bhawalkar Lane, Guru ... Chair: Lijie Chen On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization Ronen Shaltiel ...
Chair: Maryam Aliakbarpour Testing Distributions of Huge Objects Oded Goldreich (Weizmann Institute of Science); Dana Ron ... Chair: Igor Oliveira Small Circuits Imply Efficient Arthur-Merlin Protocols Michael Ezra and Ron Rothblum (Technion) Algorithms ... 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: Nicole Wein A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben (Royal Holloway, ... Shaddin Dughmi - Delegated probing in stochastic combinatorial optimization Sam Taggart - Simple Delegated Choice.
