Rounds in Communication Complexity Revisited
From MaRDI portal
Recommendations
- Round elimination in exact communication complexity
- Hardness of constant-round communication complexity
- scientific article; zbMATH DE number 1263236
- On randomized one-round communication complexity
- On the complexity of communication complexity
- Communication Complexity of Byzantine Agreement, Revisited
- Communication complexity of Byzantine agreement, revisited
- scientific article; zbMATH DE number 4197419
- scientific article; zbMATH DE number 4068270
- Lower bounds on communication complexity
Cited in
(43)- On complexity of round transformations
- Lower bounds on communication complexity
- On data structures and asymmetric communication complexity
- Hierarchy theorems for kOBDDs and kIBDDs
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- An adaptivity hierarchy theorem for property testing
- Prediction from partial information and hindsight, with application to circuit lower bounds
- Privacy in non-private environments
- Optimal collapsing protocol for multiparty pointer jumping
- Computing (and Life) Is All about Tradeoffs
- Hellinger volume and number-on-the-forehead communication complexity
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- scientific article; zbMATH DE number 5899292 (Why is no real title available?)
- Separating deterministic from randomized multiparty communication complexity
- The hardness of median in the synchronized bit communication model
- Trading bit, message, and time complexity of distributed algorithms
- Different Modes of Communication
- Superlinear lower bounds for multipass graph processing
- Extension of the hierarchy for k-OBDDs of small width
- Hadamard tensors and lower bounds on multiparty communication complexity
- scientific article; zbMATH DE number 1263236 (Why is no real title available?)
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Unexpected upper bounds on the complexity of some communication games
- The NOF multiparty communication complexity of composed functions
- Pointer chasing via triangular discrimination
- Simultaneous multiparty communication protocols for composed functions
- Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
- Verifiable stream computation and Arthur-Merlin communication
- One-way multiparty communication lower bound for pointer jumping with applications
- Broadcast Extensions with Optimal Communication and Round Complexity
- The communication complexity of pointer chasing
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
- Energy-efficient distributed algorithms for synchronous networks
- New lower bounds and hierarchy results for restricted branching programs
- The rate of interactive codes is bounded away from 1
- Polynomial pass semi-streaming lower bounds for k-cores and degeneracy
- The complexity of memory checking with covert security
- Bounded simultaneous messages
- Memory checking requires logarithmic overhead
- ( + 1) vertex coloring in O(n) communication
- Pointer chasing with unlimited interaction
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
- Reversal complexity revisited
This page was built for publication: Rounds in Communication Complexity Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037694)
