# Keywords: Limited Independence (1)

Save

View
Selected filters:
Conditions of Use:
Remix and Share
Rating

Studies how randomization can be used to make algorithms simpler and more ... More

Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest paths, and 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. Less

More
Subject:
Computer Science
Science and Technology
Material Type:
Full Course
Homework and Assignments
Lecture Notes
Syllabi
Provider:
M.I.T.
Provider Set:
MIT OpenCourseWare
Author:
Karger, David
Less
Rating

.)310.1( tcejbus ngised enotspac eht dna )150.1 ,140.1 ,130.1( stcejbus ngised aera ... More

.)310.1( tcejbus ngised enotspac eht dna )150.1 ,140.1 ,130.1( stcejbus ngised aera ytlaiceps tneuqesbus eht ni desu si hcihw decudortni si esac ngised egral A .naps efil detcepxe dna ,srotcaf laicos dna cimonoce ,tnemnorivne larutan ,tnemnorivne tliub gnitsixe eht fo noitaredisnoc sa llew sa sehcaorppa lacinhcet snrecnoc ylticilpxe ngised tcejorP .)sdaor dna segdirb ,sgnidliub ,.g.e( seitilicaf tliub no sisahpme na htiw ,sesac ngised lareves sedulcnI .gnireenigne livic ni secitcarp dna seussi ngised sa llew sa ,gnivlos-melborp evitaerc dna ngised gnireenigne fo seuqinhcet dna ,sloot ,yroeht eht ot stneduts secudortnI Less

More
Less