lec25 - 6. 6.852: Distributed Algorithms (reaching...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 25 Beyond 6.006 6.006 Spring 2008 Lecture 25: Beyond 6.006: Follow-on Classes, Geometric Folding Algorithms Algorithms Classes at MIT: (post 6.006) 1. 6.046: Intermediate Algorithms (more advanced algorithms analysis, less coding) 2. 6.047: Computational Biology (genomes, phylogeny, etc.) 3. 6.854: Advanced Algorithms (intense survey of whole Feld) 4. 6.850: Geometric Computing (working with points, lines, polygons, meshes, . . . ) 5. 6.851: Advanced Data Structures (sublogarithmic performance)
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 2

lec25 - 6. 6.852: Distributed Algorithms (reaching...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online