scientific article
From MaRDI portal
Publication:3002795
DOI10.4086/toc.2008.v004a006zbMath1213.68334OpenAlexW2170168647MaRDI QIDQ3002795
D. Sivakumar, T. S. Jayram, Ravi Kumar
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2008.v004a006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Sketching and Embedding are Equivalent for Norms ⋮ Anticoncentration and the Exact Gap-Hamming Problem ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Interval selection in the streaming model ⋮ Space lower bounds for online pattern matching ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ Space Lower Bounds for Online Pattern Matching ⋮ Unnamed Item ⋮ Everywhere-Tight Information Cost Tradeoffs for Augmented Index ⋮ Approximating Approximate Pattern Matching ⋮ Recent advances in text-to-pattern distance algorithms
This page was built for publication:
