The following pages link to (Q4038696):
Displaying 11 items.
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- The space complexity of approximating the frequency moments (Q1305928) (← links)
- Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- When distributed computation is communication expensive (Q1689746) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- (Q5875530) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
