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:
  • Modular arithmetic
  • RSA cryptosystem
  • Fast Fourier Transform
  • Graph algorithms: finding subgraphs, shorterst paths
  • Linear programming
  • Quantum computing, Shor's factoring algorithm

Course Schedule

Day Time Room
Monday 8:10-10:00Building 32, Room 108
Wednesday8:10-10:00Building 28, Room 204


Name Web page E-mail Office Office hours
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 exam, 70%.
Homework assignments, 30%. There will be 4-5 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.