Results 261 to 270 of about 5,642,848 (291)
Some of the next articles are maybe not open access.
On the communication complexity of planarity
1989We prove θ(n log n) bound for the deterministic communication complexity of the graph property planarity.
Pavol Duris, Pavel Pudlák
openaire +1 more source
Communication Complexity and Quasi Randomness
SIAM Journal on Discrete Mathematics, 1993Summary: 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
Rounds in communication complexity revisited
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991Summary: 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 of Gossiping by Packets
Journal of Parallel and Distributed Computing, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
RESCIGNO, Adele Anna +2 more
openaire +3 more sources
The Communication Complexity of Threshold Private Set Intersection
IACR Cryptology ePrint Archive, 2019Satrajit Ghosh, Mark Simkin
semanticscholar +1 more source
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity
IEEE Annual Symposium on Foundations of Computer Science, 2016Rahul Jain, A. Pereszlényi, Penghui Yao
semanticscholar +1 more source
On the Communication Complexity of Approximate Fixed Points
IEEE Annual Symposium on Foundations of Computer Science, 2016Tim Roughgarden, Omri Weinstein
semanticscholar +1 more source