Calendar

Time: 11:00AM - Equivocating Yao: Constant-Rounds Adaptively Secure Multiparty Computation in the Plain Model - Location: DIMACS Theory of Computing Seminar Other - CoRE 301

Time: 11:00AM - TBA - Location: DIMACS Theory of Computing Seminar Other - CoRE 301

Time: 11:00AM - Simultaneous Communication Complexity of Two-Player Combinatorial Auctions - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Alice and Bob Show Distribution Testing Lower Bounds (They don’t talk to each other anymore.) - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Communication requirements and Informative signaling in matching markets - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - DIMACS Theory of Computing Seminar - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Equivocating Yao: Constant-Rounds Adaptively Secure Multiparty Computation in the Plain Model - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Time-Space Hardness of Learning Sparse Parities - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - On Phase Transitions for Spiked Random Matrix and Tensor Models - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Solving Linear Programs without Breaking Abstractions - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - "A Nearly Optimal Lower Bound on the Approximate Degree of AC^0" - Location: DIMACS Theory of Computing Seminar

Time: 11:00AM - "Optimization of Bootstrapping in Circuits" - Location: DIMACS Theory of Computing Seminar CoRe 301

Time: 11:00AM - "Lower Bounds for Information-Theoretic Secure Computation" - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - "Exact tensor completion with sum-of-squares" - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Machine Learning in a Setting of Ordinal Distance Information - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - On the Quantitative Hardness of CVP Title On the Quantitative Hardness of CVP - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - A computer scientist thinks about the Brain - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Practical Data-Dependent Metric Compression with Provable Guarantees - Location: DIMACS Theory of Computing Seminar CoRe 301

Time: 11:00AM - A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem - Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM - Towards Optimal Randomness Extractors and Ramsey Graphs   - Location: DIMACS Theory of Computing Seminar CoRE 301