| 29 Apr 2019 | Alex on Optimal Las Vegas Approximate Near Neighbors in lp |
|---|
| 30 Apr 2018 | Andrea on Tight Hardness for Shortest Cycles and Paths in Sparse Graphs |
|---|---|
| 06 May 2019 | Andrea on Faster Random k-CNF Satisfiability |
| 09 Feb 2022 | Anurag on Favorite book proof - Polynomial approximations |
|---|
| 22 Jul 2019 | Ashish Dwivedi on Roots of univariate polynomials modulo prime powers |
|---|
| 24 Feb 2020 | Beatrice on Optimization of Quantum Optimization Algorithms |
|---|
| 29 Oct 2018 | Ben on Cap Sets and Rigid Matrices |
|---|---|
| 01 Apr 2019 | Ben on Random Conjectures |
| 11 Nov 2019 | Ben on Fancy reductions between counting problems |
| 27 Apr 2020 | Ben on Learning from Strategic Agents |
| 29 Oct 2020 | Ben on The Magic of Ultraproducts |
| 19 Aug 2019 | Brabeeba Wang on Convergence Analysis for Biological Oja's Rule in Solving Streaming PCA |
|---|
| 26 Nov 2021 | Chin Ho on On Fooling Read-Once CNFs Optimally |
|---|
| 22 Apr 2019 | Christina on Composition in Differential Privacy |
|---|---|
| 02 Dec 2019 | Christina on Implementing the exponential mechanism with base-2 DP |
| 03 Dec 2021 | Daniel on Efficiently Convolving Distributions |
|---|
| 25 Nov 2019 | Dylan McKay on Some Relationship(s) Between Circuit Complexity and Classical Complexity Questions |
|---|
| 20 Sep 2018 | Fred on Revisit minimum spanning tree |
|---|---|
| 25 Mar 2019 | Fred on Mirror Descent, Online Learning, and Competitive Analysis |
| 08 Apr 2022 | Greg on Set Cover in Random Order (or - what makes the SC adversary strong?) |
|---|
| 12 Nov 2021 | Jamie on How do you sample a random graph partition? |
|---|---|
| 25 Mar 2022 | Jamie on Topological Proof of the Insolvability of the Quintic |
| 05 Mar 2018 | Jarek on Monumental Graph Minor Theory |
|---|---|
| 04 Feb 2019 | Jarek on Introduction to compressed sensing |
| 24 Jun 2019 | Jarek on Measurements and Shor's algorithm |
| 08 Jul 2019 | Jarek on Sensitivity Conjecture |
| 10 Feb 2020 | Jason Li on The Karger-Stein Algorithm is Optimal for k-cut |
|---|
| 12 Nov 2020 | Jenny on Fine-grained complexity of graph distance problems |
|---|
| 16 Sep 2019 | Jiapeng on An Improved Sunflower Lemma |
|---|
| 30 Sep 2019 | Josh on Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication |
|---|---|
| 02 Mar 2020 | Josh on Faster Update Time for Turnstile Streaming Algorithms |
| 20 Apr 2020 | Josh on Quickly Finding Orthogonal Vectors and Hamming Nearest Neighbors |
| 05 Oct 2020 | Josh on Probabilistic Polynomials for Majority |
| 18 Feb 2021 | Josh on Small Low-Depth Circuits for the Walsh-Hadamard Transform |
| 15 Jul 2019 | Juspreet on Entropic inequalities |
|---|---|
| 12 Aug 2019 | Juspreet on Brascamp-Lieb, Subadditivity of Entropy and a Log-Sobolev inequality |
| 23 Sep 2019 | Juspreet on FEI conjecture - Motivations, Applications & Special Cases |
| 16 Mar 2020 | Juspreet on Entropy Flattening |
| 04 May 2020 | Juspreet on TBD |
| 29 Apr 2021 | Juspreet on Random Graphs, Long-Cycles & Local-Algorithms |
| 30 Aug 2021 | Juspreet on Overlap Gap Property, Spin Glasses & Obstructions to local Quantum Algorithms |
| 15 Oct 2021 | Juspreet on Most CSPs should have OGPs - A tale of failures |
| 11 Mar 2022 | Juspreet on Showing that limits of combinatorial statistics of random graphs exist |
| 04 Mar 2019 | Juspreet and Emil on Hardness of RCS by Design |
|---|
| 01 Apr 2021 | Kai on Application and Theory of Differentiable Optimization in Machine Learning |
|---|
| 29 Oct 2021 | Kevin on Circuit lower bounds for linear functions is hard |
|---|
| 16 Apr 2018 | Kyle on Grothendieck's inequality |
|---|
| 25 Feb 2019 | Lijie on Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits |
|---|
| 15 Apr 2022 | Max Hopkins on Set Cover in Random Order (or - what makes the SC adversary strong?) |
|---|
| 18 Nov 2019 | Meena on Understanding Sparse JL for Feature Hashing |
|---|
| 15 Oct 2020 | Mitali on Playing Unique Games on Certified Small-Set Expanders |
|---|
| 26 Feb 2018 | Mrinal on Multivariate Polynomial Factorization - 101 |
|---|
| 19 Mar 2018 | Nic on Dense Model Theorem |
|---|
| 22 Apr 2021 | Noah on Every ordering CSP is approximation resistant in the streaming setting |
|---|
| 21 Oct 2019 | Noah Stephens-Davidowitz on Seth-hardness of coding problems |
|---|
| 15 Oct 2018 | Prayaag on Mean estimation in high dimensions |
|---|---|
| 07 Dec 2020 | Prayaag on Efficient Algorithms for Heavy-Tailed Mean Estimation |
| 22 Apr 2022 | Prayaag on Ellipsoid fitting conjecture |
| 09 Apr 2018 | Preetum on Prediction with Short Memory |
|---|---|
| 01 Oct 2018 | Preetum on On Science |
| 02 Nov 2020 | Runzhou on Edge-Weighted Online Bipartite Matching |
|---|
| 23 Nov 2020 | Sandhu on TBD |
|---|
| 29 Jul 2019 | Santhoshini on Approximate Log Rank Conjecture |
|---|---|
| 28 Oct 2019 | Santhoshini on High-dimensional Expanders |
| 05 Nov 2019 | Santhoshini on Quantified 2-SAT is in P |
| 06 Apr 2020 | Santhoshini on Simple, credible and approximately-optimal multi-dimensional auctions |
| 01 Oct 2020 | Santhoshini on Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes |
| 26 Apr 2022 | Santhoshini on Proof of Kahn-Kalai expectation threshold conjecture |
| 03 Feb 2020 | Santhoshini and Chi-Ning on Settling the Approximation Ratio of Boolean Max-2CSP in the Streaming Model |
|---|
| 22 Oct 2018 | Sasha on The Minrank of Random Graph |
|---|---|
| 11 May 2020 | Sasha on Polynomial Data Structure Lower Bounds in the Group Model |
| 06 May 2021 | Shao-Heng on How to be an optimal middleman - power of Information Intermediaries in Budgeted Mechanisms |
|---|
| 30 Mar 2020 | Shweta Jain on Counting cliques in real-world graphs |
|---|
| 25 Mar 2021 | Sumegha on Coin Problem and Read-Once Branching Programs |
|---|---|
| 11 Feb 2022 | Sumegha on Sumegha's Practice Job Talk |
| 15 Apr 2021 | Ted on Pseudodistributions That Beat All PRGs |
|---|---|
| 23 Aug 2021 | Ted on Hitting Sets For Regular Branching Programs |
| 05 Nov 2021 | Ted on Hitting sets are as good as random coins, but I can't prove that |
| 29 Apr 2022 | Ted on Pseudorandom self-reductions for NP-complete problems |
| 26 Mar 2018 | Thibaut on Black box separations in cryptography and random oracles |
|---|---|
| 08 Apr 2019 | Thibaut on Understanding and manipulating the hardness of one-way functions via computational analogues of entropies |
| 15 Apr 2019 | Thibaut on Understanding and manipulating the hardness of one-way functions via computational analogues of entropies |
| 05 Aug 2019 | Thibaut on 3SUM with Preprocessing - Algorithms, Lower Bounds, and Cryptographic Applications |
| 25 Feb 2021 | Tim Chu on Manhattan distances, Kernels, and Metric Transforms. |
|---|
| 11 Mar 2019 | Tselil on Sherali-Adams Strikes Back |
|---|
| 28 Jan 2019 | Xinyu on BQP vs PH oracle separation with stochastic calculus |
|---|
| 14 May 2018 | Yi-Hsiu on Flattening Entropies |
|---|
| 09 Mar 2020 | Yuval Dagan on Interaction is necessary for distributed learning with privacy or communication constraints |
|---|