Random sampling, static and dynamic randomized algorithms, convex hulls, linear programming, arrangements of line segments and Davenport-Schinzel sequences, Voronoi diagrams with Euclidean and non-Euclidean metrics, probabilistic proofs, polyomino counting, and variants of Heilbronn's triangle problem.
See also the site of graduate school.
(05/Jun/23) The strike is over; see updated schedule below.
(15/May/23)
Note a few schedule changes in June:
Adi will give a lecture on Sunday, June 11, 2023, instead of on
Thursday, June 29, 2023.
There will not be a lecture on Thursday, June 15, 2023.
Ohad will give a lecture on Thursday, June 22, 2023.
The lecture of Thursday, June 29, 2023 will be given either by me or by
guest lecturer(s).
(23/Mar/23) A compensation lecture will be given via zoom (same zoom meeting number) on Sunday, March 26, 2023, at 8:30am.
(22/Mar/23) Due to the national paralysis day planned for tomorrow, our meeting of tomorrow morning will be held via Zoom. The zoom meeting number was distributed by E-mail.
(22/Mar/23) The day+time set for our meetings are Thursday 8:30-10:30am. The meeting place will be Taub 401.
(8/Mar/23) Students who wish to join this graduate course are asked to contact me by March 21, 2023, even if they have not read this message, otherwise they risk not being admitted to the course.
(1/Mar/23) This is a graduate course (the only active 238 course in the CS department). It will be given as a semi-seminar, meaning talks will be split between the students and myself. A student's talk might occupy 2-4 hours, depending on the number of registered students. Please contact me as early as possible in order to fix the material of your talk(s). Please also register to the mailing list of the course. (This has nothing to do with the formal registration to the course!) For this purpose, please send me your full name, id number, which degree you pursue, and your mobile phone number.
(1/Mar/23)
Topics covered in the course will include:
1. Random sampling [BY98, ch.4]
2. Randomized algorithms [BY98, ch.5]
3. Dynamic randomized algorithms [BY98, ch.6]
4. Arrangements of segments and Davenport-Schinzel sequences
[BY98, ch.15]
+ survey
(+ [SA95] as a background)
5. The probabilistic method [AS00, a few sections]
Optional topics:
6. Incremental convex hulls [BY98, ch.8]
7. Voronoi diagrams - Euclidean metric [BY98, ch.17]
8. Voronoi diagrams - Non-Euclidean metrics [BY98, ch.18]
Topics covered by me:
9. Lattice animals
10. Heilbronn's triangle problem
See the tentative schedule here.
The allocated time is Monday 10:30-12:30, at hall Taub 401.
Class performance: 70%.
Final quiz: 30% (tentative date: TBA).