The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- On communication protocols that compute almost privately (Q714841) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- A second look at counting triangles in graph streams (Q740973) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Toward better depth lower bounds: two results on the multiplexor relation (Q777911) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- New bounds on the half-duplex communication complexity (Q831813) (← links)
- The communication cost of selfishness (Q840676) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- A characterization of average case communication complexity (Q845939) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- On the memory requirements of XPath evaluation over XML streams (Q878756) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- On cover-structure graphs (Q967385) (← links)
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758) (← links)
- A note on the size of OBDDs for the graph of integer multiplication (Q975522) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Informational requirements of social choice rules (Q1013515) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- On the guessing number of shift graphs (Q1026230) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- A three-party communication problem (Q1278045) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Hardness results for multicast cost sharing. (Q1401398) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- Recognition problems and communication complexity. (Q1422409) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Protocols for asymmetric communication channels (Q1604209) (← links)
- A note on randomized mutual search. (Q1606991) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
