The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- On Slepian-Wolf theorem with interaction (Q1635810) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- On the monotonicity of a data stream (Q1677498) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Information theoretical cryptogenography (Q1698396) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- The direct sum of universal relations (Q1751432) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728) (← links)
- On finding common neighborhoods in massive graphs. (Q1874417) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- Cellular automata and communication complexity (Q1885923) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- On the fastest Vickrey algorithm (Q1957643) (← links)
- Exact OBDD bounds for some fundamental functions (Q1959388) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- The hardest halfspace (Q1983325) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- On the minimal Hamming weight of a multi-base representation (Q2009155) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Search complexity: a way for the quantitative analysis of the search space (Q2039682) (← links)
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering (Q2056927) (← links)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
