4 citations · 7 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Near-Optimal Cayley Expanders for Abelian Groups
Akhil Jalan, Dana Moshkovitz
We give an efficient deterministic algorithm that outputs an expanding generating set for any finite abelian group. The size of the generating set is close to the randomized constr…
cs.CC2021
Strong Parallel Repetition for Unique Games on Small Set Expanders
Dana Moshkovitz
Strong Parallel Repetition for Unique Games on Small Set Expanders The strong parallel repetition problem for unique games is to efficiently reduce the 1-delta vs. 1-C*delta gap pr…