Simons Institute for the Theory of Computing
453 old videos with fewer than 5,000 views from this channel.
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions
-
32:46
How Well Do Prices Coordinate Markets
-
35:22
Computational Efficiency Requires Simple Taxation
-
17:28
From Channel Assignment to Subgraph Isomorphism
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
25:26
Lower Bounds for Problems Parameterized by Clique-width
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
29:25
Spotting Trees with Few Leaves
-
58:20
Lower Bound Issues in Computational Social Choice
-
29:47
Parameterized Inapproximability of Max k-Subset Intersection under ETH
-
24:28
More Needles in the Hay Might Make it Harder to Find One?
-
37:13
Parameterized and Promised Streaming
-
1:06:22
The Square Root Phenomenon in Planar Graphs -- Survey and New Results
-
45:30
Informational Substitutes and Complements for Prediction
-
50:56
Incentive Auctions and Spectrum Repacking
-
49:45
Strong Truthfulness in Multi-signal Peer Prediction with Overlapping Tasks
-
43:43
The Design of Financial Exchanges: Some Open Questions at the Intersection of Econ and CS