Uri Zwick's home page

Uri Zwick

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

-----

Current Courses

·        Analysis of Algorithms (February-July 2013)

-----

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

-----

 

http://www.cs.tau.ac.il/%7Ezwick/slides/overhang.gif
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