Keywords: Game-Theoretic Techniques (1)

save
save to

Please log in to save materials.

selected filters:
Randomized Algorithms, Fall 2002

Randomized Algorithms, Fall 2002

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)

Subject:
Science and Technology
Material Type:
Full Course
Homework and Assignments
Lecture Notes
Syllabi
Collection:
MIT OpenCourseWare
Provider:
M.I.T.
Author:
Karger, David
Remix and Share
2002 llaF ,gnivloS melborP gnireenignE dna sretupmoC ot noitcudortnI

2002 llaF ,gnivloS melborP gnireenignE dna sretupmoC ot noitcudortnI

.desu si egaugnal gnimmargorp avaJ ehT .gninnalp dna ,tnemeganam ,ecneics ,gnireenigne ni ... (more)

.desu si egaugnal gnimmargorp avaJ ehT .gninnalp dna ,tnemeganam ,ecneics ,gnireenigne ni smelborp gnivlos rof seuqinhcet gnipoleved no si sisahpmE .scipot decnavda detceles dna scihparg retupmoc ,gnihcraes dna gnitros ,serutcurts atad ,sdohtem laciremun ,secafretni resu lacihparg ,stpecnoc gnimmargorp revoc smelborp gnimmargorp ylkeeW .esruoc eht fo sucof eht si tnempoleved dna ngised erawtfos detneiro-tcejbO .snoitacilppa cifitneics dna gnireenigne rof sdohtem lanoitatupmoc dna tnempoleved erawtfos latnemadnuf stneserp esruoc sihT (less)

Subject:
Science and Technology
Material Type:
Assessments
Full Course
Homework and Assignments
Lecture Notes
Syllabi
Collection:
MIT OpenCourseWare
Provider:
M.I.T.
Author:
George Kocur
Remix and Share