Author:
Bar-Yossef Ziv,Jayram T. S.,Krauthgamer Robert,Kumar Ravi
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58(1), 137–147 (1999)
2. Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proceedings of IEEE Data Compression Conference, DCC, pp. 279–288 (1992)
3. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. J. of Computer and System Sciences 52(2), 299–307 (1996)
4. Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficientl (2004) (manuscript)
5. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: Information theory methods in communication complexity. In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pp. 93–102 (2002)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Learning and Communication Complexity of Subsequence Containment;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
2. Compressed Communication Complexity of Longest Common Prefixes;String Processing and Information Retrieval;2018
3. Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error;ACM Transactions on Algorithms;2013-06
4. Everywhere-Tight Information Cost Tradeoffs for Augmented Index;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2011
5. Sparse Recovery with Partial Support Knowledge;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2011