10 citations · 63 across the 24 of their papers we have counts for
Showing 2018 · cs.CCShow all
3 papers · 2 filters
cs.CC2018
List Decoding with Double Samplers
Irit Dinur, Prahladh Harsha, Tali Kaufman +2
We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose…
cs.CC2018★ 7 cited
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
Irit Dinur, Pasin Manurangsi
We study the 2-ary constraint satisfaction problems (2-CSPs), which can be stated as follows: given a constraint graph , an alphabet set and, for each ,…
cs.CC2018★ 5 cited
Boolean functions on high-dimensional expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus +1
We initiate the study of Boolean function analysis on high-dimensional expanders. We give a random-walk based definition of high-dimensional expansion, which coincides with the ear…