1 citations · 1 across the 17 of their papers we have counts for
1 paper · 2 filters
Emile Anand
Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness a…