The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420) (← links)
- The Hardness of Median in the Synchronized Bit Communication Model (Q3010421) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Limitations on Quantum Dimensionality Reduction (Q3012794) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- The Complexity of Data Aggregation in Directed Networks (Q3095346) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- On maximal isolation sets in the uniform intersection matrix (Q3300704) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- (Q3477957) (← links)
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656) (← links)
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique (Q3511317) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- No nonlocal box is universal (Q3544386) (← links)
- On Toda’s Theorem in Structural Communication Complexity (Q3599108) (← links)
- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (Q3618582) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- Construction of Very Hard Functions for Multiparty Communication Complexity (Q4494482) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- (Q4612484) (← links)
- (Q4612486) (← links)
- (Q4612487) (← links)
- Interleaved Group Products (Q4634030) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- (Q4650570) (← links)
