Pages that link to "Item:Q3002795"
From MaRDI portal
The following pages link to The one-way communication complexity of Hamming distance (Q3002795):
Displaying 15 items.
- Space lower bounds for online pattern matching (Q390881) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- The communication complexity of gap Hamming distance (Q2913808) (← links)
- The Information Complexity Of Hamming Distance (Q2969639) (← links)
- Space Lower Bounds for Online Pattern Matching (Q3011853) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- (Q5090388) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)