Local Algorithms for Two Problems on Locally Tree-Like Graphs
499 views · Published 29 February 2016 · 44:53 · Indexed 25 October 2026
Channel: Simons Institute for the Theory of Computing · 2016 · Education
Andrea Montanari, Stanford University Approximate Counting, Markov Chains and Phase Transitions https://simons.berkeley.edu/talks/andrea-montanari-02-22-2016
More 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