Pages that link to "Item:Q4037694"

The following pages link to Rounds in Communication Complexity Revisited (Q4037694):

Displaying 27 items.

• Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
• Superlinear lower bounds for multipass graph processing (Q343847) (← links)
• Extension of the hierarchy for \(k\)-OBDDs of small width (Q353910) (← links)
• Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
• The NOF multiparty communication complexity of composed functions (Q496305) (← links)
• One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
• Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
• Reversal complexity revisited (Q935164) (← links)
• On data structures and asymmetric communication complexity (Q1273860) (← links)
• Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
• An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
• Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
• Privacy in non-private environments (Q2429730) (← links)
• Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
• The Hardness of Median in the Synchronized Bit Communication Model (Q3010421) (← links)
• Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
• Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)
• Pointer chasing via triangular discrimination (Q4993101) (← links)
• (Q5005112) (← links)
• Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
• Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
• The communication complexity of pointer chasing (Q5943092) (← links)
• Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)