2009 |
21 | EE | Iordanis Kerenidis:
Quantum multiparty communication complexity and circuit lower bounds.
Mathematical Structures in Computer Science 19(1): 119-132 (2009) |
2008 |
20 | EE | André Chailloux,
Iordanis Kerenidis:
Increasing the power of the verifier in Quantum Zero Knowledge.
FSTTCS 2008 |
19 | EE | André Chailloux,
Dragos Florin Ciocan,
Iordanis Kerenidis,
Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.
TCC 2008: 501-534 |
18 | EE | Ziv Bar-Yossef,
T. S. Jayram,
Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity.
SIAM J. Comput. 38(1): 366-384 (2008) |
17 | EE | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.
SIAM J. Comput. 38(5): 1695-1708 (2008) |
2007 |
16 | EE | Dmitry Gavinsky,
Julia Kempe,
Iordanis Kerenidis,
Ran Raz,
Ronald de Wolf:
Exponential separations for one-way quantum communication complexity, with applications to cryptography.
STOC 2007: 516-525 |
15 | EE | Iordanis Kerenidis:
Quantum Multiparty Communication Complexity and Circuit Lower Bounds.
TAMC 2007: 306-317 |
14 | EE | Elham Kashefi,
Iordanis Kerenidis:
Statistical Zero Knowledge and quantum one-way functions.
Theor. Comput. Sci. 378(1): 101-116 (2007) |
2006 |
13 | EE | Iordanis Kerenidis,
Ran Raz:
The one-way communication complexity of the Boolean Hidden Matching Problem
CoRR abs/quant-ph/0607173: (2006) |
12 | EE | Iordanis Kerenidis,
Ran Raz:
The one-way communication complexity of the Boolean Hidden Matching Problem.
Electronic Colloquium on Computational Complexity (ECCC) 13(087): (2006) |
2004 |
11 | EE | Ziv Bar-Yossef,
T. S. Jayram,
Iordanis Kerenidis:
Exponential separation of quantum and classical one-way communication complexity.
STOC 2004: 128-137 |
10 | EE | Ziv Bar-Yossef,
T. S. Jayram,
Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC)(036): (2004) |
9 | EE | Iordanis Kerenidis,
Ashwin Nayak:
Weak coin flipping with small bias.
Inf. Process. Lett. 89(3): 131-135 (2004) |
8 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Quantum symmetrically-private information retrieval.
Inf. Process. Lett. 90(3): 109-114 (2004) |
7 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument.
J. Comput. Syst. Sci. 69(3): 395-420 (2004) |
2003 |
6 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument.
STOC 2003: 106-115 |
5 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Quantum Symmetrically-Private Information Retrieval
CoRR quant-ph/0307076: (2003) |
2002 |
4 | EE | Petros Drineas,
Iordanis Kerenidis,
Prabhakar Raghavan:
Competitive recommendation systems.
STOC 2002: 82-90 |
3 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
CoRR quant-ph/0208062: (2002) |
2 | EE | Iordanis Kerenidis,
Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes
Electronic Colloquium on Computational Complexity (ECCC)(059): (2002) |
2001 |
1 | EE | Chris Harrelson,
Iordanis Kerenidis:
Quantum Clock Synchronization with one qubit
CoRR cs.CC/0103021: (2001) |