Pages that link to "Item:Q1273860"
From MaRDI portal
The following pages link to On data structures and asymmetric communication complexity (Q1273860):
Displaying 30 items.
- Certifying equality with limited interaction (Q343864) (← links)
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- Randomized OBDDs for the most significant bit of multiplication need exponential space (Q1944061) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- On realization of left and right products of rational functions (Q2696301) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- (Q5090374) (← links)
- (Q5090424) (← links)
- (Q5090444) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- (Q5121915) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- Design of extended dense coding protocol strategy based on combinatorial optimization (Q6166201) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
