16 citations · 25 across the 2 of their papers we have counts for
3 papers
math.CO2010
Intersecting Families of Permutations
David Ellis, Ehud Friedgut, Haran Pilpel
A set of permutations is said to be {\em k-intersecting} if any two permutations in agree on at least points. We show that for any , if $n…
quant-ph2008★ 9 cited
Quantum Multi Prover Interactive Proofs with Communicating Provers
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in th…
quant-ph2007★ 16 cited
No nonlocal box is universal
Frédéric Dupuis, Nicolas Gisin, Avinatan Hassidim +2
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known…