TCS+

External homepage

computational complexity computational geometry cryptography and security discrete mathematics data structures and algorithms game theory machine learning quantum computing and information combinatorics information theory optimization and control probability

Audience:	Researchers in the topic
Seminar series time:	Wednesday 17:00-18:00 in your time zone, UTC
Organizers:	Clément Canonne*, Anindya De, Sumegha Garg, Gautam Kamath, Ilya Razenshteyn, Oded Regev, Tselil Schramm, Thomas Vidick, Erik Waingarten
	*contact for this listing

Description: Theoretical Computer Science

People can register to a talk via our webpage sites.google.com/site/plustcs/livetalk , or subscribe to our calendar and mailing list at sites.google.com/site/plustcs/rss-feeds

Upcoming talks

Past talks

Your time			Speaker	Title
Wed	Jun 01	17:00	Inbal Talgam-Cohen	Algorithmic contract theory
Wed	May 18	17:00	Thatchaphol Saranurak	All-pairs minimum cuts in nearly quadratic time: a tutorial
Wed	May 04	17:00	Vera Traub	Recent Developments in Graph Augmentation Problems
Wed	Apr 20	17:00	Rasmus Kyng	Almost-Linear Time Algorithms for Maximum Flow and More
Wed	Apr 06	17:00	Jessica Sorrell	Reproducibility in Learning
Wed	Mar 23	22:00	Shuichi Hirahara	Excluding PH Pessiland
Wed	Mar 09	18:00	Roei Tell	Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
Wed	Feb 23	18:00	Merav Parter	New Diameter Reducing Shortcuts: Breaking the $O(\sqrt{n})$ Barrier
Wed	Dec 08	18:00	Guy Blanc	Properly learning decision trees in almost polynomial time
Wed	Dec 01	18:00	William Kuszmaul	Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering
Wed	Nov 10	18:00	Kuikui Liu	Spectral Independence: A New Tool to Analyze Markov Chains
Wed	Oct 27	17:00	Shravas Rao	Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem
Wed	Oct 13	17:00	Nutan Limaye	Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
Wed	Sep 29	17:00	Audra McMillan	Hiding among the clones: a simple and nearly optimal analysis of privacy amplification by shuffling
Wed	Jun 09	17:00	Pravesh Kothari and Ankur Moitra	Robustly Learning Mixtures of Gaussians
Wed	May 26	17:00	Kira Goldner	An Overview of Using Mechanism Design for Social Good
Wed	May 12	17:00	Santhoshini Velusamy	Classification of the approximability of all finite Max-CSPs in the dynamic streaming setting
Wed	Apr 28	17:00	Ronen Eldan	Localization, stochastic localization, and Chen's recent breakthrough on the Kannan-Lovasz-Simonivits conjecture
Wed	Apr 14	17:00	Andrea Lincoln	New Techniques for Proving Fine-Grained Average-Case Hardness
Wed	Mar 31	17:00	Jasper Lee	Optimal Sub-Gaussian Mean Estimation in $\mathbb{R}$
Wed	Mar 17	17:00	Avishay Tal	Junta Distance Approximation with Sub-Exponential Queries
Wed	Mar 03	18:00	Steve Hanneke	A Theory of Universal Learning
Wed	Feb 17	18:00	William Hoza	Fooling Constant-Depth Threshold Circuits
Wed	Dec 02	18:00	Yang Liu	Faster Algorithms for Unit Maximum Flow
Wed	Nov 25	18:00	Sumegha Garg	The Coin Problem with Applications to Data Streams
Wed	Nov 11	18:00	Shuai Shao	A Dichotomy for Real Boolean Holant Problems
Wed	Nov 04	18:00	Shalev Ben-David	Forecasting Algorithms, Minimax Theorems, and Randomized Lower Bounds
Wed	Oct 28	17:00	Omar Montasser	Adversarially Robust Learnability: Characterization and Reductions
Wed	Oct 21	17:00	Aayush Jain	Indistinguishability Obfuscation from Well-Founded Assumptions
Wed	Oct 14	17:00	Jayadev Acharya	Distributed Statistical Inference under Local Information Constraints
Wed	Oct 07	17:00	Susanna F. de Rezende	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
Wed	Sep 30	17:00	Alex Wein	Low-Degree Hardness of Random Optimization Problems
Wed	Sep 23	17:00	Fotis Iliopoulos	Stochastic Local Search and the Lovasz Local Lemma
Thu	Sep 17	17:00	Richard Peng	Solving Sparse Linear Systems Faster than Matrix Multiplication
Thu	Jun 18	17:00	Clifford Stein	Parallel approximate undirected shortest paths via low hop emulators
Wed	Jun 03	17:00	Michael P. Kim	Learning from outcomes: evidence-based rankings
Wed	May 27	17:00	Rahul Ilango	Is it (NP) hard to distinguish order from chaos?
Wed	May 20	17:00	Mark Bun	An Equivalence between Private Classification and Online Predictability
Wed	May 13	17:00	Sahil Singla	Online vector balancing and geometric discrepancy
Wed	May 06	17:00	Nathan Klein	An improved approximation algorithm for TSP in the half integral case
Wed	Apr 29	17:00	Sepideh Mahabadi	Non-Adaptive Adaptive Sampling in Turnstile Streams
Wed	Apr 22	17:00	Huacheng Yu	Nearly Optimal Static Las Vegas Succinct Dictionary

Embed this schedule

Export series to