Walk the Walk: On Pseudorandomness, Expansion, and Connectivity Omer Reingold Weizmann Institute Based on join works with Michael Capalbo, Kai-Min Chung,
Pseudorandom Walks: Looking Random in The Long Run or All The Way? Omer Reingold Weizmann Institute.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 6 April 13, 2005 .
Approximating the Distance to Properties in Bounded-Degree and Sparse Graphs Sharon Marko, Weizmann Institute Dana Ron, Tel Aviv University.
Approximating the Distance to Properties in Bounded-Degree and Sparse Graphs
