Contents (hide)

Welcome to Algorithms 2 homepage

Course Description

In this course we will study advanced techniques for algorithm design, focusing on problems that are relevant in real-life applications. We will analyze the algorithms by diverse methods, 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
  • Hashing
  • Randomized algorithms
  • Online algorithms

Course Schedule

Day Time Room
Sunday 12:00-14:00Building 90, Room 140
Thursday10:00-12:00Building 90, Room 233


Name Web page E-mail Office Office hours
Eden Chlamtac chlamtac at cs dot bgu dot ac dot il Building 37, Room 210 Thu. 12-14
Ofer Neiman neimano at cs dot bgu dot ac dot il Building 37, Room 215 Wed. 10-12


  1. S. Dasgupta, C.H. Papadimitriou, U.V. Vazirani, Algorithms. McGraw-Hill 2006.

Grading Policy

Final home exam, 60%. Students MUST PASS the exam to pass the course.
Homework assignments, 40%. There will be 4 homework assignments.
You may hand in the exercises either by yourself or with one other student. Students whose partner has a valid reason not to hand in some assignment must still hand in the assignment. You may not hand in the assignments in groups larger than two. Cheating will not be tolerated.