Author:
Gutfreund Dan,Rothblum Guy N.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Blinkovsky, V.M.: Bounds for codes in the case of list decoding of finite volume. Problems of Information Transmission 22(1), 7–19 (1986)
2. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing 13(4), 850–864 (1984)
3. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. Journal of the ACM 45(6), 965–981 (1998)
4. Deshpande, A., Jain, R., Kavitha, T., Radhakrishnan, J., Lokam, S.V.: Better Lower Bounds for Locally Decodable Codes. In: Proceedings of the IEEE Conference on Computational Complexity, pp. 184–193 (2002)
5. Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G.N.: Verifying and decoding in constant depth. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 440–449 (2007)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献