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 timeSpeakerTitle
WedJun 0917:00Pravesh Kothari and Ankur MoitraRobustly Learning Mixtures of Gaussians
WedMay 2617:00Kira GoldnerAn Overview of Using Mechanism Design for Social Good
WedMay 1217:00Santhoshini VelusamyClassification of the approximability of all finite Max-CSPs in the dynamic streaming setting
WedApr 2817:00Ronen EldanLocalization, stochastic localization, and Chen's recent breakthrough on the Kannan-Lovasz-Simonivits conjecture
WedApr 1417:00Andrea LincolnNew Techniques for Proving Fine-Grained Average-Case Hardness
WedMar 3117:00Jasper LeeOptimal Sub-Gaussian Mean Estimation in $\mathbb{R}$
WedMar 1717:00Avishay TalJunta Distance Approximation with Sub-Exponential Queries
WedMar 0318:00Steve HannekeA Theory of Universal Learning
WedFeb 1718:00William HozaFooling Constant-Depth Threshold Circuits
WedDec 0218:00Yang LiuFaster Algorithms for Unit Maximum Flow
WedNov 2518:00Sumegha GargThe Coin Problem with Applications to Data Streams
WedNov 1118:00Shuai ShaoA Dichotomy for Real Boolean Holant Problems
WedNov 0418:00Shalev Ben-DavidForecasting Algorithms, Minimax Theorems, and Randomized Lower Bounds
WedOct 2817:00Omar MontasserAdversarially Robust Learnability: Characterization and Reductions
WedOct 2117:00Aayush JainIndistinguishability Obfuscation from Well-Founded Assumptions
WedOct 1417:00Jayadev AcharyaDistributed Statistical Inference under Local Information Constraints
WedOct 0717:00Susanna F. de RezendeLifting with Simple Gadgets and Applications to Circuit and Proof Complexity
WedSep 3017:00Alex WeinLow-Degree Hardness of Random Optimization Problems
WedSep 2317:00Fotis IliopoulosStochastic Local Search and the Lovasz Local Lemma
ThuSep 1717:00Richard PengSolving Sparse Linear Systems Faster than Matrix Multiplication
ThuJun 1817:00Clifford SteinParallel approximate undirected shortest paths via low hop emulators
WedJun 0317:00Michael P. KimLearning from outcomes: evidence-based rankings
WedMay 2717:00Rahul IlangoIs it (NP) hard to distinguish order from chaos?
WedMay 2017:00Mark BunAn Equivalence between Private Classification and Online Predictability
WedMay 1317:00Sahil SinglaOnline vector balancing and geometric discrepancy
WedMay 0617:00Nathan KleinAn improved approximation algorithm for TSP in the half integral case
WedApr 2917:00Sepideh MahabadiNon-Adaptive Adaptive Sampling in Turnstile Streams
WedApr 2217:00Huacheng YuNearly Optimal Static Las Vegas Succinct Dictionary
Embed this schedule
Export series to