This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 6. 6.852: Distributed Algorithms (reaching consensus in a network with faults) 7. 6.855: Network Optimization (optimization in graph: beyond shortest paths ) 8. 6.856: Randomized Algorithms (how randomness makes algorithms simpler & faster) 9. 6.857: Network and Computer Security (cryptography) 10. 6.885: Geometric and olding Algorithms * TODAY Other Theory Classes: 6.045: Automata, Computability, & Complexity 6.840: Theory of Computing 6.841: Advanced Complexity Theory 6.842: Randomness & Computation 1...
View Full Document
This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.
- Spring '08