Travelled to:1 × Canada
1 × Japan
1 × Switzerland
3 × USA
Collaborated with:R.d.Wolf A.Chailloux B.Rosgen Z.Bar-Yossef T.S.Jayram P.Drineas P.Raghavan D.Gavinsky J.Kempe R.Raz L.Fontes R.Jain S.Laplante M.Laurière J.Roland
Talks about:quantum (4) complex (4) exponenti (3) communic (3) separ (3) way (2) one (2) cryptographi (1) recommend (1) competit (1)
Person: Iordanis Kerenidis
DBLP: Kerenidis:Iordanis
Contributed to:
20152011
2007200420032002Wrote 6 papers:
- ICALP-v1-2015-FontesJKLLR #communication #complexity
- Relative Discrepancy Does not Separate Information and Communication Complexity (LF, RJ, IK, SL, ML, JR), pp. 506–516.
- ICALP-v1-2011-ChaillouxKR #complexity #quantum
- Quantum Commitments from Complexity Assumptions (AC, IK, BR), pp. 73–85.
- STOC-2007-GavinskyKKRW #communication #complexity #encryption #exponential #quantum
- Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.
- STOC-2004-Bar-YossefJK #communication #complexity #exponential #quantum
- Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
- STOC-2003-KerenidisW #bound #exponential #quantum
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.
- STOC-2002-DrineasKR #recommendation
- Competitive recommendation systems (PD, IK, PR), pp. 82–90.