Welcome to the Algorithms 2 homepage
Course DescriptionIn this course we will study advanced techniques for algorithm design in various computational frameworks and models. We will use various tools to analyze these algorithms, such as number theory, combinatorial, algebraic and geometric tools etc.
Some of the possible topics are:
- Primality testing
- Fast Fourier Transform
- RSA cryptosystem
- Matchings in graphs
- Markov chains
- Advanced data structures, union-find
- Quantum computing, Shor's factoring algorithm
- Linear programming
- Dynamic programming
- Randomized algorithms
- Online algorithms
|Sunday||12:00-14:00||Building 90, Room 241|
|Thursday||12:00-14:00||Building 90, Room 241|
|Name||Web page||Office||Office hours|
|Eden Chlamtac||http://www.cs.bgu.ac.il/~chlamtac||chlamtac at cs dot bgu dot ac dot il||Building 37, Room 210||Sun. 17-19|
- S. Dasgupta, C.H. Papadimitriou, U.V. Vazirani, Algorithms. McGraw-Hill 2006.
Grading PolicyFinal take-home exam, 60%.
Homework assignments, 40%.
There will be a short question assigned each week, worth one point.
Both homework and exam grades will be assigned on a curve (i.e., a "factor"), taking into consideration the difficulty of the questions. Your grade will not be a simple average or sum of points accumulated.
You should feel free to discuss the weekly questions with each other, but you must hand in your own solution.