Random Sampling, Static and Dynamic Randomized Algorithms, Computing Convex Hulls, Linear Programming, Arrangements of Line Segments And Davenport-schinzel Sequences, Voronoi Diagrams With Euclidean and Non- Euclidean Metrics, Probabilistic Proofs.

Faculty: Computer Science
|Graduate Studies

Course with no extra credit

236739


Semestrial Information