dblp.uni-trier.dewww.uni-trier.de

Iordanis Kerenidis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Ziv Bar-Yossef [10] [11] [18]
2André Chailloux [19] [20]
3Dragos Florin Ciocan [19]
4Petros Drineas [4]
5Dmitry Gavinsky [16] [17]
6Chris Harrelson [1]
7T. S. Jayram (Jayram S. Thathachar) [10] [11] [18]
8Elham Kashefi [14]
9Julia Kempe [16] [17]
10Ashwin Nayak [9]
11Prabhakar Raghavan [4]
12Ran Raz [12] [13] [16] [17]
13Salil P. Vadhan [19]
14Ronald de Wolf [2] [3] [5] [6] [7] [8] [16] [17]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)