The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- (Q5149029) (← links)
- (Q5158502) (← links)
- On the complexity of communication complexity (Q5172741) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- Communication Complexity (Q5213788) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Worst-case asymmetric distributed function computation (Q5326145) (← links)
- Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
- Energy Complexity of Recurrent Neural Networks (Q5378352) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- Parallel Repetition of the Odd Cycle Game (Q5458570) (← links)
- Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
- Automata, Languages and Programming (Q5466510) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- On Slepian–Wolf Theorem with Interaction (Q5740187) (← links)
- Fourier Sparsity of GF(2) Polynomials (Q5740202) (← links)
- The communication complexity of addition (Q5741754) (← links)
- (Q5743415) (← links)
- (Q5743466) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Rectangles are nonnegative juntas (Q5890971) (← links)
- Deterministic compression with uncertain priors (Q5891037) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Derandomization for sliding window algorithms with strict correctness (Q5918353) (← links)
- On pure space vs catalytic space (Q5918608) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Information complexity of the AND function in the two-party and multi-party settings (Q5919672) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
- Sharing the cost of multicast transmissions (Q5952450) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- On the power of Las Vegas II: Two-way finite automata (Q5958109) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
