The Economic Limits of Permissionless Consensus (FC '24 Keynote) Tim Roughgarden Lectures 25,3 тыс. подписчиков Скачать
8 Reasons Why Mechanism Design for Blockchains Is Hard (and Fascinating) (Tim Roughgarden @ CCE '22) Скачать
Foundations of Blockchains (Lecture 10.5: Selfish Mining with Honest-Node-Controlled Tie-Breaking) Скачать
Foundations of Blockchains (Lecture 10.4: Selfish Mining with Deviator-Controlled Tie-Breaking) Скачать
Foundations of Blockchains (Lecture 9.6: An Impossibility Result for Proof-of-Work Protocols) Скачать
Foundations of Blockchains (Lecture 5.3: Interpretation and Broader Context of the FLP Theorem) Скачать
Foundations of Blockchains (Lecture 5.2: Completing the Proof of the FLP Impossibility Theorem) Скачать
Foundations of Blockchains (Lecture 5.1: Reducing The FLP Impossibility Theorem to Two Lemmas) Скачать
A Theory of DeFi? (Keynote talk at the 2021 ACM CCS Workshop on Decentralized Finance and Security) Скачать
An Axiomatic Approach to Block Rewards (Tim Roughgarden @ Stanford Blockchain Conference 2020) Скачать
Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 2/2] Скачать
Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 1/2] Скачать
Algorithms for NP-Hard Problems (Section 23.3: NP: Problems with Easily Recognized Solutions) Скачать
Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 1/2] Скачать
Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 2/2] Скачать
Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 2/2] Скачать
Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2] Скачать
Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [1/2] Скачать
Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [2/2] Скачать
Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 1/2] Скачать
A Second Course in Algorithms (Lecture 20: Semidefinite Programming and the Maximum Cut Problem) Скачать
A Second Course in Algorithms (Lecture 18: Five Essential Tools for Analyzing Randomized Algorithms) Скачать
A Second Course in Algorithms (Lecture 12: Applications of Multiplicative Weights to Games and LPs) Скачать
A Second Course in Algorithms (Lecture 11: Online Learning and the Multiplicative Weights Algorithm) Скачать
A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming) Скачать
A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching) Скачать
Beyond Worst-Case Analysis (Lecture 20: From Unknown Input Distributions to Instance Optimality) Скачать
![Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 2/2]](http://i.ytimg.com/vi/n2twBqDsPlE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 2/2]](http://i.ytimg.com/vi/lRM3vN3tUpE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 1/2]](http://i.ytimg.com/vi/H21OkYM6gD0/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 1/2]](http://i.ytimg.com/vi/a4_bU02eIRA/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.2: Color Coding) [Part 1 of 2]](http://i.ytimg.com/vi/VvWvjHQL63Y/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 1/2]](http://i.ytimg.com/vi/D8aHqaFa8GE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 2/2]](http://i.ytimg.com/vi/9DwFwkAwnmY/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.2: Color Coding) [Part 2 of 2]](http://i.ytimg.com/vi/as7IJ2Ma98U/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 2/2]](http://i.ytimg.com/vi/fHldsoBMFKI/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 2 of 2]](http://i.ytimg.com/vi/hZfHrJ0GvGM/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 1 of 2]](http://i.ytimg.com/vi/fn5HNoiMwHM/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]](http://i.ytimg.com/vi/dYEWqrp-mho/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [1/2]](http://i.ytimg.com/vi/GqKbx3LCQqE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [2/2]](http://i.ytimg.com/vi/_1-Vv5Vid9Q/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 2 of 2]](http://i.ytimg.com/vi/CcdYLcLymV4/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 1/2]](http://i.ytimg.com/vi/GcJy8uzSUbA/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 2/2]](http://i.ytimg.com/vi/8vbKIfpDPJI/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 1 of 2]](http://i.ytimg.com/vi/6ik0R5UNf10/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 2/2]](https://i.ytimg.com/vi/n2twBqDsPlE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 2/2]](https://i.ytimg.com/vi/lRM3vN3tUpE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.2: Greedy Heuristics for Buying Back Licenses) [Pt 1/2]](https://i.ytimg.com/vi/H21OkYM6gD0/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 1/2]](https://i.ytimg.com/vi/a4_bU02eIRA/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.2: Color Coding) [Part 1 of 2]](https://i.ytimg.com/vi/VvWvjHQL63Y/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 1/2]](https://i.ytimg.com/vi/D8aHqaFa8GE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 2/2]](https://i.ytimg.com/vi/9DwFwkAwnmY/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 21.2: Color Coding) [Part 2 of 2]](https://i.ytimg.com/vi/as7IJ2Ma98U/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 2/2]](https://i.ytimg.com/vi/fHldsoBMFKI/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 2 of 2]](https://i.ytimg.com/vi/hZfHrJ0GvGM/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 1 of 2]](https://i.ytimg.com/vi/fn5HNoiMwHM/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]](https://i.ytimg.com/vi/dYEWqrp-mho/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [1/2]](https://i.ytimg.com/vi/GqKbx3LCQqE/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [2/2]](https://i.ytimg.com/vi/_1-Vv5Vid9Q/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.1: Makespan Minimization) [Part 2 of 2]](https://i.ytimg.com/vi/CcdYLcLymV4/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 1/2]](https://i.ytimg.com/vi/GcJy8uzSUbA/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 2/2]](https://i.ytimg.com/vi/8vbKIfpDPJI/mqdefault.jpg)
![Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 1 of 2]](https://i.ytimg.com/vi/6ik0R5UNf10/mqdefault.jpg)
