MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Lower Bounds on Communication Complexity" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

134 documents found, showing 1 through 10. Next 10 →

ATOM

Lower bounds in communication complexity based on factorization norms
by Nati Linial, Adi Shraibman — 2007 — In Proc. of the 39th Symposium on Theory of Computing (STOC
…Lower Bounds in Communication Complexity Based on Factorization Norms Nati Linial Adi Shraibman…
Cited by 16 (3 self) – Add To MetaCart

The Pattern Matrix Method for Lower Bounds on Communication Complexity ∗
by Er A. Sherstov
…The Pattern Matrix Method for Lower Bounds on Communication Complexity ∗ Alexander A. Sherstov…
Add To MetaCart

A linear lower bound on the communication complexity of single-server private information retreival
by Iftach Haitner, Jonathan J. Hoch, Gil Segev — 2008 — In preparation
…A Linear Lower Bound on the Communication Complexity of Single-Server Private Information…
Cited by 2 (1 self) – Add To MetaCart

An Information Statistics Approach to Data Stream and Communication Complexity
by Ziv Bar-yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar — 2003
… for proving strong lower bounds in communication complexity. This method is based on the notion…
Cited by 61 (2 self) – Add To MetaCart

Communication Complexity Lower Bounds by Polynomials
by Harry Buhrman, Ronald De Wolf — 1999 — in Proceedings of the 16th Annual IEEE Conference on Computational Complexity
…Communication Complexity Lower Bounds by Polynomials Harry Buhrman Ronald de Wolf y October 12…
Cited by 39 (9 self) – Add To MetaCart

Lower Bounds on Threshold and Related Circuits via Communication Complexity
by Roychowdhury Orlitsky, V. P. Roychowdhury, A. Orlitsky, K. Y. Siu — 1994 — IEEE Transactions on Information Theory
… Lower Bounds on Threshold and Related Circuits via Communication Complexity V. P. Roychowdhury…
Cited by 5 (0 self) – Add To MetaCart

A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity
by Jürgen Forster — 2001
…A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity Jurgen Forster…
Cited by 22 (0 self) – Add To MetaCart

A lower bound for the bounded round quantum communication complexity of set disjointness
by Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
…A lower bound for the bounded round quantum communication complexity of set disjointness Rahul…
Cited by 9 (4 self) – Add To MetaCart

Communication Complexity as a Lower Bound for Learning in Games
by Vincent Conitzer Conitzer, Tuomas Sandholm — 2004 — In Proceedings of the 21st International Conference on Machine Learning
…Communication complexity as a lower bound for learning in games Vincent Conitzer conitzer…
Cited by 8 (4 self) – Add To MetaCart

Communication Complexity Towards Lower Bounds on Circuit Depth
by Jeff Edmonds Steven, Steven Rudich, Russell Impagliazzo — 1991 — 32nd FOCS
…Communication Complexity Towards Lower Bounds on Circuit Depth Jeff Edmonds Steven Rudich…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB