Course: Advanced algorithm
Given by: Guy Kortsarz.
Office: 319 Business and Science Bldg.

Office hours: By appointment.


Subjects covered:
Amortized cost

Binomial heaps

Fibonacci heaps

Sorting networks

Algorithmic number theory: short notes I made.
For a PDF file

Algorithmic number theory
For a PDF file
Random walk with some
sample of Markov chains properties
LP theory
Since the subject is hard,
we will have two different talks
on LP theory
Talk 1: For PDF File
For a PDF file
Talk 2
For a powerpoint

Approximation algorithm
For a pdf file

Computing the running time of
recursive procedures and finding
the median.


Book of the course: Introduction to algorithms by
Cormen Rivest and Leiserson plus lecture notes by Dr Kortsarz.
In addition to power points and PDF files.

1) The course will be taught as a seminar.
Students will be assigned to subjects.
Every students will teach with prepared power
point or a PDF file. Hopefully one class
Your grade will in large part be based on how well is your presentation
2) You also have to summarize classes you did not teach.
Your grade is partially based on how good are the summaries
3) There are exercises in the homepage. Try to solve as many as you can.
and your grade is partially based on the solutions
for exercises

Theoretical exercises For a pdf file

Try to solve as many exercises as you can.