Communication complexity
From MaRDI portal
Recommendations
Cites work
Cited in
(52)- Complete classifications for the communication complexity of regular languages
- A nonlinear lower bound on the practical combinational complexity
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- On the complexity of communication complexity
- One-way multiparty communication lower bound for pointer jumping with applications
- Best-order streaming model
- STACS 2004
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators
- Lower bounds on the area complexity of Boolean circuits
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
- scientific article; zbMATH DE number 1962802 (Why is no real title available?)
- The advantages of a new approach to defining the communication complexity for VLSI
- scientific article; zbMATH DE number 1405691 (Why is no real title available?)
- Space-bounded communication complexity
- Paradigms for Unconditional Pseudorandom Generators
- Results on communication complexity classes
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Communication complexity of multi-processor systems
- ``Global graph problems tend to be intractable
- On the power of Las Vegas II: Two-way finite automata
- Communication complexity and combinatorial lattice theory
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
- An information statistics approach to data stream and communication complexity
- scientific article; zbMATH DE number 7561590 (Why is no real title available?)
- On the power of randomized multicounter machines
- Prediction from partial information and hindsight, with application to circuit lower bounds
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Probabilistic communication complexity over the reals
- Communication Complexity
- Individual communication complexity
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
- Communication complexity of PRAMs
- Superlinear lower bounds for multipass graph processing
- Quantifying communication in synchronized languages
- On the P versus NP intersected with co-NP question in communication complexity
- scientific article; zbMATH DE number 3881884 (Why is no real title available?)
- The communication complexity of addition
- Universal semantic communication
- The communication complexity of pointer chasing
- Communication complexity of two decision problems
- Trade-offs between communication and space
- Computing (and Life) Is All about Tradeoffs
- Quantifying communication in synchronized languages
- Lower bounds on the multiparty communication complexity
- scientific article; zbMATH DE number 4147508 (Why is no real title available?)
- Automata, Languages and Programming
- On limitations of transformations between combinatorial problems
- scientific article; zbMATH DE number 2134904 (Why is no real title available?)
- scientific article; zbMATH DE number 1011685 (Why is no real title available?)
- On multi-partition communication complexity
- scientific article; zbMATH DE number 3872716 (Why is no real title available?)
- A nonlinear lower bound on the practical combinational complexity
This page was built for publication: Communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069701)
