Competitive Analysis: Self-organizing Lists 
Competitive Analysis: Self-organizing Lists
by MIT / Erik Demaine
Video Lecture 14 of 25
Copyright Information: Erik Demaine and Charles Leiserson, 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. (MIT OpenCourseWare: Massachusetts Institute of Technology), (Accessed December 22, 2008). License: Creative commons BY-NC-SA
Not yet rated
Views: 1,502
Date Added: March 23, 2009

Lecture Description

This video lecture, part of the series 18.410J Introduction to Algorithms (SMA 5503) by Prof. Erik Demaine, does not currently have a detailed description and video lecture title. If you have watched this lecture and know what it is about, particularly what Mathematics topics are discussed, please help us by commenting on this video with your suggested description and title. Many thanks from,

- The CosmoLearning Team

Course Index

Course Description

This course features a complete set of lecture notes and videos. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.

Tags: Math, Math Algorithms


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)