Uri Zwick's home page

Uri Zwick
Dept. of Computer Science
Tel Aviv Univerusity
Tel Aviv 69978
Israel

E-mail: zwick at tau dot ac dot il
TEL:    +972 3 6409610
FAX:   +972 3 6409357

On-line available papers, slides and presentations

• APPROXIMATION ALGORITHMS

• CIRCUIT COMPLEXITY

• DATA STRUCTURES

• DISTANCES and SHORTEST PATHS

• DYNAMIC GRAPH ALGORITHMS

• GRAPH ALGORITHMS

• MATHEMATICAL GAMES

• MATRIX MULTIPLICATION

• ONLINE ALGORITHMS

• PARALLEL ALGORITHMS

• ROUTING

• SELECTING THE MEDIAN

• STRING MATCHING

• STRING FOLDING

Courses

• Analysis of Algorithms (Spring 2009)

• Undergraduate Seminar on Algorithm

Overhang (.pps file)

Mike Paterson, Uri Zwick,
Overhang,
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA'06), pp. 231-240.
[Link to the ACM Digital Library] [draft (pdf)]

Old class notes

• Boolean Circuit Complexity (Fall 94/95, Tel Aviv)

• Boolean Circuit Complexity (Fall 96/97, Berkeley)

Fundamentals.co.il