Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
63 views

6.006 Introduction To Algorithms: Mit Opencourseware

This document summarizes a lecture about algorithms courses beyond MIT's 6.006 Introduction to Algorithms course. It lists 10 advanced algorithms courses at MIT, including 6.850 on geometric computing and 6.855 on folding algorithms, which are the focus of the lecture. It also mentions several other theory-based computer science courses at MIT.

Uploaded by

ankitdocs
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
63 views

6.006 Introduction To Algorithms: Mit Opencourseware

This document summarizes a lecture about algorithms courses beyond MIT's 6.006 Introduction to Algorithms course. It lists 10 advanced algorithms courses at MIT, including 6.850 on geometric computing and 6.855 on folding algorithms, which are the focus of the lecture. It also mentions several other theory-based computer science courses at MIT.

Uploaded by

ankitdocs
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

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.

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 eld) 4. 6.850: Geometric Computing (working with points, lines, polygons, meshes, . . . ) 5. 6.851: Advanced Data Structures (sublogarithmic performance) 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 Folding Algorithms * TODAY

Other Theory Classes:


6.045: Automata, Computability, & Complexity 6.840: Theory of Computing 6.841: Advanced Complexity Theory 6.842: Randomness & Computation

You might also like