?? index.htm
字號(hào):
</tr><tr class="white-row"><td headers="col1">4</td><td headers="col2">Coupon Collecting, Stable Marriage, Markov Inequality (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/C98EE649-75E1-4DE4-B31B-F1E54B8D5A95/0/n4.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">5</td><td headers="col2">Chebyshev, Two Point Sampling, Chernoff (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/1A049FF6-2903-43DD-9A4B-589B12DA94A2/0/n5.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">6</td><td headers="col2">Median Finding, Routing (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/CD859C43-F7E6-4E5E-AFBA-A6B182BAE5E0/0/n6.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">7</td><td headers="col2">Probabilistic Method, Expanders, Wiring, MAX SAT (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/362EEC35-343F-4877-9331-756FF00A9640/0/n7.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">8</td><td headers="col2">Method of Conditional Probabilities and Expectations, Fingerprinting (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/CCC378DE-91C8-4F04-9E6B-D62088012C16/0/n8.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">9</td><td headers="col2">Hashing, Perfect Hash Families, Freivald's Technique (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/3B940133-C125-4015-B93D-4F4FD731878C/0/n9.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">10</td><td headers="col2">Fingerprints by Polynomials, Perfect Matching, Hashing (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/BE8E290F-2286-4C05-9B09-36409EAC851B/0/n10.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">11</td><td headers="col2">Shortest Paths (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/42D342D5-BCF6-4DEC-96B0-41279FE9BCE4/0/n11.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">12</td><td headers="col2">Parallel Algorithms (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/F577E2AF-0C04-4375-9C2B-5EB5467235E8/0/n12.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">13</td><td headers="col2">Maximal Independent Sets (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/26FC388D-A4D6-4FC8-9E21-C75E0CCC23D2/0/n13.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">14</td><td headers="col2">Minimum Spanning Trees (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/0AE152C0-515D-4E01-8981-E1971C6E0340/0/n14.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">15</td><td headers="col2">Polling, Minimum Cut, Transitive Closure (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/B4B2E8DC-4E04-4A78-B7BA-5684117AE7F8/0/n15.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">16</td><td headers="col2">Estimating Min-Cut Size (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/47CB15DA-F54F-4B28-91EA-CB0A857E2207/0/n16.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">17</td><td headers="col2">Linear Programming (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/2B82D395-2E8C-4311-A542-564F40EA2A11/0/n17.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">18</td><td headers="col2">DNF Counting (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/0C56229A-23C9-4E46-9262-5D436B530475/0/n18.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">19</td><td headers="col2">Markov Chains (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/99EEF696-EB46-467A-9531-1824F65D6A9B/0/n19.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">20</td><td headers="col2">UTS, Eigenvalue Analysis, Expanders (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/207A2035-690A-4B04-A8C2-630120D9CF90/0/n20.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">21</td><td headers="col2">Expander based Pseudo-Random Generator (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/A44CB128-CC8F-410B-81D9-C0649B12C432/0/n21.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">22</td><td headers="col2">Sampling with Markov Chains, Coupling (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/A229C64E-17A5-4CAA-9426-6FDA704358B8/0/n22.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">23</td><td headers="col2">Computational Geometry (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/2499BE35-CF85-4983-8E9C-CB7BB5008149/0/n23.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">24</td><td headers="col2">Randomized Incremental Construction (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/29C4B25E-BCD8-42EC-8DDA-B89B4F445EC2/0/n24.pdf">PDF</a>)</td></tr><tr class="gray-row"><td headers="col1">25</td><td headers="col2">Trapezoidal Decomposition, Treaps (<a href="../../../../NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-856JRandomized-AlgorithmsFall2002/E668481E-91C0-4A67-B511-3816EBA9AABF/0/n25.pdf">PDF</a>)</td></tr><tr class="white-row"><td headers="col1">26</td><td headers="col2">Online Algorithms</td></tr><!-- TEN ROWS --></tbody></table><!-- END INNER TABLE --></td></tr></tbody></table><!-- END OUTER TABLE --></div> </div> </div><!--End of courses_inner" div--> </div><!-- End of main_content_course div--> <div class="clear"></div> </div><!--End of content_body div--> </div><!-- End main div --> <div class="footer"> <div class="footer_logo"> <a href="http://web.mit.edu"><img src="../../../../OcwWeb/images/trans.gif" alt="MIT Logo" width="65" height="35" align="top" title="MIT Logo"></a> <a href="../../../../OcwWeb/web/terms/terms/index.htm"><img src="../../../../OcwWeb/images/trans.gif" alt="Copyright 2002-2007 MIT" width="100" height="13" align="textTop" title="Copyright 2002-2007 MIT"></a> </div> <div class="footer_links"> <ul> <li class="first"> <a href="http://ocw.mit.edu/OcwWeb/web/about/rss/index.htm"><img src="../../../../OcwWeb/images/footer_rss_new.gif" border="0" width="32" height="15" align="absbottom" alt="RSS Feeds"></a><a href="http://ocw.mit.edu/OcwWeb/web/about/rss/index.htm">RSS Feeds</a> <li> <a href="../../../../OcwWeb/web/terms/terms/index.htm">Privacy and Terms of Use</a> <li> <a href="http://ocw.mit.edu/OcwWeb/web/help/sitemap/index.htm">Site Map</a></li> </ul> <p>Your use of the MIT OpenCourseWare site and course materials is subject to our Creative Commons License and other terms of use.</p> <!-- end footer links --> </div> <div class="license"> <a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/3.0/us/" target="_blank" class="first"><img src="../../../../OcwWeb/images/cc_logo_new.gif" alt="Creative Commons - some rights reserved" border="0" width="80" height="15"></a><br> <a rel="license" href="http://www.ocwconsortium.org/" target="_blank" class="first"> <img src="../../../../OcwWeb/images/ocw-logo_new.gif" alt="OCW Consortium" width="80" height="44"></a></div></div><DIV></DIV><!-- end footer --><!-- Start Webtrends Tracking Tag --><noscript> <div> </div></noscript><!-- End Webtrends Tracking Tag --> </A> </form> </div> </body></html>
?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -