Courses:

Engineering and Applied Sciences >> Computer Science


For Course Instructors

  • Advertise your course for free
  • Feature your course listing
  • Create course discussion group
  • Link to your course page
  • Increase student enrollment

More Info...>>


Course Info

  • Course Number / Code:
  • 18.416J (Fall 2002) 
  • Course Title:
  • Randomized Algorithms 
  • Course Level:
  • Graduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Electrical Engineering and Computer Science 
  • Course Instructor(s):
  • Prof. David R. Karger 
  • Course Introduction:
  •  


  • 6.856J / 18.416J Randomized Algorithms



    Fall 2002




    Course Highlights


    This course site features a full set of lecture notes and problem sets with solutions.


    Course Description


    This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.
     

ACKNOWLEDGEMENT:
This course content is a redistribution of MIT Open Courses. Access to the course materials is free to all users.






© 2010-2021 OpenCollege.com, All Rights Reserved.
Open College is a service mark of AmeriCareers LLC.