| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 3601 |
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3602 |
23. New Directions in Crypto (M-I-T)
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3603 |
5. SAT Reductions (M-I-T)
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3604 |
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3605 |
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3606 |
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3607 |
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3608 |
4. Transactions and the UTXO model (M-I-T)
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3609 |
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3610 |
9. Graph Problems (M-I-T)
|
Algorithmic Lower Bounds (Fall 2014) (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine
|
Applied Sciences
|
| 3611 |
5. Synchronization Process and Pruning (M-I-T)
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3612 |
6. Wallets and SPV (M-I-T)
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3613 |
7. Catena: Efficient Non-equivocation via Bitcoin (M-I-T)
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3614 |
|
Cryptocurrency Engineering and Design (M-I-T)
|
MIT
|
Neha Narula, Tadge Dryja
|
Applied Sciences
|
| 3615 |
Demonstration 1: Sampling (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3616 |
Demonstration 2: Sampling (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3617 |
Lec 1 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3618 |
Lec 10 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3619 |
Lec 11 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3620 |
Class 10: Kempe's Universality Theorem (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3621 |
Class 11: Generic Rigidity (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3622 |
Lec 12 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3623 |
Class 12: Tensegrities (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
| 3624 |
Lec 13 | MIT RES.6-008 Digital Signal Processing, 1975 (M-I-T)
|
Digital Signal Processing (M-I-T)
|
MIT
|
Prof. Alan V. Oppenheim
|
Applied Sciences
|
| 3625 |
Class 13: Locked Linkages (M-I-T)
|
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)
|
MIT
|
Prof. Erik Demaine
|
Applied Sciences
|
