Results 281 to 290 of about 423,241 (305)

On the communication complexity of polling

Information Processing Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Privacy and communication complexity

30th Annual Symposium on Foundations of Computer Science, 1989
After a short introduction, in paragraph 2, the author presents the model and the definition of privacy. In paragraph 3 he gives a characterization of the privately computable functions, and in paragraph 4 he deals with the communication complexity and rounds complexity of these functions.
openaire   +2 more sources

On the communication complexity of planarity

1989
We prove θ(n log n) bound for the deterministic communication complexity of the graph property planarity.
Pavol Duris, Pavel Pudlák
openaire   +1 more source

Rounds in communication complexity revisited

Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991
Summary: The \(k\)-round two-party communication complexity was studied in the deterministic model by \textit{P. H. Papadimitriou} and \textit{M. Sipser} [J. Comput. Syst. Sci. 28, 260-269 (1984; Zbl 0584.68064)] and \textit{P. Duris}, \textit{Z. Galil} and \textit{G. Schnitger} [Inf. Comput.
Noam Nisan, Avi Wigderson
openaire   +2 more sources

Communication Complexity and Quasi Randomness

SIAM Journal on Discrete Mathematics, 1993
Summary: The multiparty communication complexity concerns the least number of bits that must be exchanged among a number of players to collaboratively compute a Boolean function \(f(x_ 1,\dots,x_ k)\), while each player knows at most \(t\) inputs for some fixed ...
Fan R. K. Chung, Prasad Tetali
openaire   +1 more source

Communication Complexity

1990
Faigle, U., Turan, G.
openaire   +2 more sources

Communication Complexity

1996
Eyal Kushilevitz, Noam Nisan
openaire   +1 more source

Private vs. common random bits in communication complexity

Information Processing Letters, 1991
Ilan Newman
exaly  

Quantum Entanglement and Communication Complexity

SIAM Journal on Computing, 2001
Harry Buhrman, Richard Cleve, Wim Van Dam   +2 more
exaly  

The Probabilistic Communication Complexity of Set Intersection

SIAM Journal on Discrete Mathematics, 1992
Bala Kalyanasundaram
exaly