Course

M480 - Randomized Algorithms and Probabilistic Methods

Course No: 
M480
Credit: 
4
Prerequisites: 
M206
Approval: 
2014
UG-Elective
Syllabus: 
Inequalities of Markov and Chebyshev (median algorithm), first and second moment method (balanced allocation), inequalities of Chernoff (permutation routing) and Azuma (chromatic number), rapidly mixing Markov chains (random walk in hypercubes, card shuffling), probabilistic generating functions (random walk in d-dimensional lattice)
Reference Books: 
  1. R. Motwani, P. Raghavan, “Randomized Algorithms”, Cambridge University Press, 2004.
  2. M. Mitzenmacher, E. Upfal, “Probability and Computing: Randomized algorithms and probabilistic analysis”, Cambridge University Press, 2005

Contact us

School of Mathematical Sciences

NISERPO- Bhimpur-PadanpurVia- Jatni, District- Khurda, Odisha, India, PIN- 752050

Tel: +91-674-249-4081

Corporate Site - This is a contributing Drupal Theme
Design by WeebPal.