The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Iordanis Kerenidis" ( http://dblp.L3S.de/Authors/Iordanis_Kerenidis )

  Author page on DBLP  Author page in RDF  Community of Iordanis Kerenidis in ASPL-2

Publication years (Num. hits)
2001-2007 (18) 2008-2012 (15)
Publication types (Num. hits)
article(20) inproceedings(13)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 11 keywords

Results
Found 33 publication records. Showing 33 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao Lower bounds on information complexity via zero-communication protocols and applications. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao Lower bounds on information complexity via zero-communication protocols and applications Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland Non-local box complexity and secure function evaluation. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2011 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Shengyu Zhang A quantum protocol for sampling correlated equilibria unconditionally and without a mediator Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis, Bill Rosgen Quantum Commitments from Complexity Assumptions. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis Optimal Bounds for Quantum Bit Commitment. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang On the Power of a Unique Quantum Witness. Search on Bibsonomy ICS The full citation details ... 2010 DBLP  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis, Jamie Sikora Lower bounds for Quantum Oblivious Transfer. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Iordanis Kerenidis Quantum multiparty communication complexity and circuit lower bounds. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis Optimal Quantum Strong Coin Flipping. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF strong coin-flipping protocol, quantum cryptography
1Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland Non-Local Box Complexity and Secure Function Evaluation. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis Exponential Separation of Quantum and Classical One-Way Communication Complexity. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF noninteractive zero-knowledge proofs, quantum zero knowledge, computational complexity, cryptography, Arthur-Merlin games, commitment schemes
1André Chailloux, Iordanis Kerenidis Increasing the power of the verifier in Quantum Zero Knowledge. Search on Bibsonomy FSTTCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Elham Kashefi, Iordanis Kerenidis Statistical Zero Knowledge and quantum one-way functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2007 DBLP  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis The role of help in Classical and Quantum Zero-Knowledge. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2007 DBLP  BibTeX  RDF
1Iordanis Kerenidis Quantum Multiparty Communication Complexity and Circuit Lower Bounds. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf Exponential separations for one-way quantum communication complexity, with applications to cryptography. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cryptography, communication complexity, quantum
1Iordanis Kerenidis, Ran Raz The one-way communication complexity of the Boolean Hidden Matching Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Ran Raz The one-way communication complexity of the Boolean Hidden Matching Problem Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Ronald de Wolf Quantum symmetrically-private information retrieval. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Iordanis Kerenidis, Ashwin Nayak Weak coin flipping with small bias. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis Exponential Separation of Quantum and Classical One-Way Communication Complexity Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Ronald de Wolf Exponential lower bound for 2-query locally decodable codes via a quantum argument. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis Exponential separation of quantum and classical one-way communication complexity. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF hidden matching, quantum computation, communication complexity, separation
1Iordanis Kerenidis, Ronald de Wolf Quantum Symmetrically-Private Information Retrieval Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Ronald de Wolf Exponential lower bound for 2-query locally decodable codes via a quantum argument. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF quantum computing, private information retrieval, locally decodable codes
1Iordanis Kerenidis, Ronald de Wolf Exponential Lower Bound for 2-Query Locally Decodable Codes Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Ronald de Wolf Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan Competitive recommendation systems. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Chris Harrelson, Iordanis Kerenidis Quantum Clock Synchronization with one qubit Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
Displaying result #1 - #33 of 33 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.