Communication complexity - PDFSEARCH.IO - Document Search Engine

Communication complexity
Results: 253

#	Item
1	Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB) Add to Reading List Source URL: www.pcqc.fr Language: English - Date: 2016-07-08 07:27:55
2	The communication complexity of addition Emanuele Viola∗ December 12, 2013 Abstract Suppose each of k ≤ no(1) Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2013-12-12 13:50:10
3	Communication Complexity for Distributed Graphs Qin Zhang Indiana University Bloomington Add to Reading List Source URL: adga2016.hiit.fi Language: English - Date: 2016-10-10 15:45:13
4	The multiparty communication complexity of interleaved group products W. T. Gowers∗ Emanuele Viola† Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2016-08-10 10:37:12
5	1 Fundamental limits on complexity and power consumption in coded communication Pulkit Grover† , Andrea Goldsmith† , Anant Sahai‡ † Stanford University ‡ University of California, Berkeley Add to Reading List Source URL: users.ece.cmu.edu Language: English - Date: 2012-10-31 02:33:27
6	The multiparty communication complexity of interleaved group products October 2016 Emanuele Viola NEU Joint work with Timothy Gowers Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2016-10-07 10:40:40
7	STOC 2017 Accepted Papers • Exponential separation between quantum communication complexity and classical information complexity Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu • Local max-cut in smoothed polyn Add to Reading List Source URL: acm-stoc.org Language: English - Date: 2017-02-22 10:15:46
8	The communication complexity of addition, with applications August 2014 Emanuele Viola Northeastern University Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-09-05 15:19:28
9	CS369E: Communication Complexity (for Algorithm Designers) Lecture #1: Data Streams: Algorithms and Lower Bounds∗ Tim Roughgarden† January 8, 2015 Add to Reading List Source URL: theory.stanford.edu - Date: 2015-09-14 13:13:10
10	The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication Dirk Van Gucht1 Ryan Williams2 1 Add to Reading List Source URL: homes.soic.indiana.edu - Date: 2015-03-10 22:15:09

UPDATE