|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 11 keywords
|
|
|
|
|
Results
Found 39 publication records. Showing 39 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A property of quantum relative entropy with an application to privacy in quantum communication.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
quantum communication complexity, Privacy, quantum information theory |
| 2 | Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita |
Multi-party Quantum Communication Complexity with Routed Messages. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Alexander A. Sherstov |
The pattern matrix method for lower bounds on quantum communication. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximate degree of boolean functions, bounded-error communication, quantum communication complexity, lower bounds |
| 2 | Ashley Montanaro, Andreas Winter |
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
Unbounded-Error Classical and Quantum Communication Complexity. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Gilles Brassard |
Quantum Communication Complexity: A Survey. |
ISMVL |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Peter Høyer, Ronald de Wolf |
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Ronald de Wolf |
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
non-deterministic computation, Quantum computing, communication complexity, query complexity |
| 1 | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf |
New bounds on the classical and quantum communication complexity of some graph properties |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Elloá B. Guedes, Francisco Marcos de Assis |
Quantum Communication Complexity of Quantum Authentication Protocols |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shengyu Zhang |
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Wunderlich, Stefan Arnold |
On a singular value method in quantum communication complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita |
Multi-Party Quantum Communication Complexity with Routed Messages. |
IEICE Transactions |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yaoyun Shi, Yufan Zhu |
Quantum communication complexity of block-composed functions. |
Quantum Information & Computation |
2009 |
DBLP BibTeX RDF |
|
| 1 | Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland |
The Communication Complexity of Non-signaling Distributions. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck |
Lower Bounds for Quantum Communication Complexity. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
Unbounded-Error One-Way Classical and Quantum Communication Complexity. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
cryptography, communication complexity, quantum |
| 1 | Nati Linial, Adi Shraibman |
Lower bounds in communication complexity based on factorization norms. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
factorization norms, communication complexity, discrepancy, Fourier analysis |
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
Prior Entanglement, Message Compression and Privacy in Quantum Communication. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
On the Communication Complexity of Co-linearity Problems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
On the Power of Quantum Proofs. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
The Quantum Communication Complexity of Sampling. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Ronald de Wolf |
Improved Quantum Communication Complexity Bounds for Disjointness and Equality |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck |
Lower Bounds for Quantum Communication Complexity. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in quantum communication and the complexity of set disjointness. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Communication Complexity Lower Bounds by Polynomials. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranab Sen, Srinivasan Venkatesh |
Lower Bounds in the Quantum Cell Probe Model. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
Interaction in Quantum Communication Complexity |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck |
Quantum Communication Complexity. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Amnon Ta-Shma |
Classical versus quantum communication complexity. |
SIGACT News |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
The Quantum Communication Complexity of Sampling. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Quantum Circuit Complexity |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
quantum communication complexity, quantum circuit complexity, Boolean circuit model, quantum Turing machine, polynomial time |
Displaying result #1 - #39 of 39 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")