The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- Privacy in non-private environments (Q2429730) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Mechanism design with a restricted action space (Q2437830) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- The communication requirements of social choice rules and supporting budget sets (Q2455666) (← links)
- The complexity of fixed point models of trust in distributed networks (Q2463564) (← links)
- Communication complexity of some number theoretic functions (Q2470553) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Non-independent randomized rounding and coloring (Q2489958) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- Individual communication complexity (Q2643018) (← links)
- Bounds on the number of 2-level polytopes, cones, and configurations (Q2664102) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Menu mechanisms (Q2675411) (← links)
- Enhancing distributed functional monitoring with quantum protocols (Q2677525) (← links)
- Quantum one-way versus classical two-way communication in XOR games (Q2687124) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- New strong direct product results in communication complexity (Q2796407) (← links)
- Upper and lower bounds on the power of advice (Q2816830) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (Q2828234) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Equality, Revisited (Q2946382) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- Distributed Control of Linear Systems Allowing Choices (Q2954471) (← links)
- Quantum communication complexity advantage implies violation of a Bell inequality (Q2962327) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
