The following pages link to Communication complexity (Q1069701):
Displaying 46 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Quantifying communication in synchronized languages (Q344766) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Best-order streaming model (Q534570) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- On the P versus NP intersected with co-NP question in communication complexity (Q1044738) (← links)
- The advantages of a new approach to defining the communication complexity for VLSI (Q1106661) (← links)
- Communication complexity of multi-processor systems (Q1118403) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Results on communication complexity classes (Q1190990) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Communication complexity of two decision problems (Q1201105) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Lower bounds on the multiparty communication complexity (Q1267715) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- Complete classifications for the communication complexity of regular languages (Q1771314) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Probabilistic communication complexity over the reals (Q2269005) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Individual communication complexity (Q2643018) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- (Q3477957) (← links)
- On limitations of transformations between combinatorial problems (Q3979606) (← links)
- (Q4337605) (← links)
- (Q4650570) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- (Q5091258) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
- On the complexity of communication complexity (Q5172741) (← links)
- Communication Complexity (Q5213788) (← links)
- STACS 2004 (Q5309684) (← links)
- Automata, Languages and Programming (Q5466510) (← links)
- The communication complexity of addition (Q5741754) (← links)
- The communication complexity of pointer chasing (Q5943092) (← links)
- On the power of Las Vegas II: Two-way finite automata (Q5958109) (← links)
