The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- Distributed adaptive Gaussian mean estimation with unknown variance: interactive protocol helps adaptation (Q2091825) (← links)
- The binary rank of circulant block matrices (Q2093516) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- On public-coin zero-error randomized communication complexity (Q2169433) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- The communication complexity of graphical games on grid graphs (Q2190386) (← links)
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs (Q2216926) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- How long to Pareto efficiency? (Q2248903) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Distributed monitoring of election winners (Q2289007) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Communication complexity tools on recognizable picture languages (Q2330109) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Communication complexity and linearly ordered sets (Q2363626) (← links)
- Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Two absolute bounds for distributed bit complexity (Q2382670) (← links)
- A second look at counting triangles in graph streams (corrected) (Q2397608) (← links)
- The (minimum) rank of typical fooling-set matrices (Q2399380) (← links)
- The Boolean rank of the uniform intersection matrix and a family of its submatrices (Q2419048) (← links)
- Nondeterministic communication complexity with help and graph functions (Q2420638) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- New results on the most significant bit of integer multiplication (Q2429728) (← links)
