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
Matchings
Graph algorithms: finding subgraphs, shorterst paths
Dynamic Programming
Advanced data structures
Randomized algorithms (LLL)

Course Schedule

Day	Time	Room
Monday	14:00-16:00	Building 97, Room 205
Thursday	12:00-14:00	Building 28, Room 106

Instructors

Name	Web page	E-mail	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	Tue. 14-16
Ofer Neiman	http://www.cs.bgu.ac.il/~neimano	neimano at cs dot bgu dot ac dot il	Building 37, Room 215	Thu. 10-12

Textbook

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.