Courses > PHD Courses
Top image

 
Home
News
Courses
Management Team
Conferences
Dutch OR Groups
People
Links
Contact
 

Landelijk Netwerk Mathematische Besliskunde

Course RA: Randomized Algorithms

Time: Monday 11.00 - 12.45 (March 1 - March 29 and April 12 - May 10).
Location: TBD. All LNMB courses will be taught on-line until further notice.
Lecturer: Prof.dr. N. Bansal (CWI, Eindhoven University of Technology) and Dr. R.A. Sitters (CWI, VU Amsterdam)

Course description:
The topics are:
Randomness has proven itself to be a useful resource for developing provably efficient algorithms and protocols. This course will explore examples from a variety of settings and problem areas such as graph algorithms, algorithms in algebra, approximate counting, probabilistically checkable proofs, algorithms for big data, and matrix algorithms. Topics also include an introduction to tools from probability theory, including matringales, Chernoff bounds and Lovasz Local lemma.

Prerequisites:
Elementary knowledge of probability theory.

Examination:
Take home problems.

Address of the lecturers: 
Prof.dr. N. Bansal
Networks and Optimization Group, CWI
Science Park 123, 1098 XG Amsterdam
Phone: 020-5924386
E-mail: N.Bansal@cwi.nl

Dr.ir. R.A. Sitters
Department of Econometrics and Operations Research
Faculty of Economics & Business Administration, VU University Amsterdam,
De Boelelaan 1105, 1081 HV Amsterdam
Phone: 020 - 5989391
E-mail: rsitters@feweb.vu.nl