6.046J / 18.410J Introduction to Algorithms, Fall 2001
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theor...
| Egile Nagusiak: | , , |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Learning Object |
| Hizkuntza: | en-US |
| Argitaratua: |
2001
|
| Gaiak: | |
| Sarrera elektronikoa: | http://hdl.handle.net/1721.1/36847 |
| _version_ | 1826190408791621632 |
|---|---|
| author | Demaine, Erik D. Leiserson, Charles Eric Lee, Wee Sun |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Demaine, Erik D. Leiserson, Charles Eric Lee, Wee Sun |
| author_sort | Demaine, Erik D. |
| collection | MIT |
| description | Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Enrollment may be limited. |
| first_indexed | 2024-09-23T08:39:49Z |
| format | Learning Object |
| id | mit-1721.1/36847 |
| institution | Massachusetts Institute of Technology |
| language | en-US |
| last_indexed | 2025-03-10T07:14:49Z |
| publishDate | 2001 |
| record_format | dspace |
| spelling | mit-1721.1/368472025-02-25T16:48:01Z 6.046J / 18.410J Introduction to Algorithms, Fall 2001 Introduction to Algorithms Demaine, Erik D. Leiserson, Charles Eric Lee, Wee Sun Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Department of Mathematics algorithms efficient algorithms sorting search trees heaps hashing divide-and-conquer dynamic programming amortized analysis graph algorithms shortest paths network flow computational geometry number-theoretic algorithms polynomial and matrix calculations caching parallel computing 6.046J 18.410J 6.046 18.410 Algorithms Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Enrollment may be limited. 2001-12 Learning Object 6.046J-Fall2001 local: 6.046J local: 18.410J local: IMSCP-MD5-ee70ee63c71e617e18a30203563ab607 http://hdl.handle.net/1721.1/36847 en-US Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. text/html Fall 2001 |
| spellingShingle | algorithms efficient algorithms sorting search trees heaps hashing divide-and-conquer dynamic programming amortized analysis graph algorithms shortest paths network flow computational geometry number-theoretic algorithms polynomial and matrix calculations caching parallel computing 6.046J 18.410J 6.046 18.410 Algorithms Demaine, Erik D. Leiserson, Charles Eric Lee, Wee Sun 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title_full | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title_fullStr | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title_full_unstemmed | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title_short | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 |
| title_sort | 6 046j 18 410j introduction to algorithms fall 2001 |
| topic | algorithms efficient algorithms sorting search trees heaps hashing divide-and-conquer dynamic programming amortized analysis graph algorithms shortest paths network flow computational geometry number-theoretic algorithms polynomial and matrix calculations caching parallel computing 6.046J 18.410J 6.046 18.410 Algorithms |
| url | http://hdl.handle.net/1721.1/36847 |
| work_keys_str_mv | AT demaineerikd 6046j18410jintroductiontoalgorithmsfall2001 AT leisersoncharleseric 6046j18410jintroductiontoalgorithmsfall2001 AT leeweesun 6046j18410jintroductiontoalgorithmsfall2001 AT demaineerikd introductiontoalgorithms AT leisersoncharleseric introductiontoalgorithms AT leeweesun introductiontoalgorithms |