Y. Aumann and M. Bender, Fault tolerant data structures, Proceedings of 37th Conference on Foundations of Computer Science, pp.580-589, 1996.
DOI : 10.1109/SFCS.1996.548517

A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond, Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.261-270, 2002.
DOI : 10.1109/SFCS.2002.1181949

E. Ben-sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan, Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding, STOC'04, pp.889-974, 2006.
DOI : 10.1137/S0097539705446810

G. Brodal, R. Fagerberg, I. Finocchi, F. Grandoni, G. Italiano et al., Optimal resilient dynamic dictionaries, Proceedings of 15th European Symposium on Algorithms (ESA), pp.347-358, 2007.
DOI : 10.7146/brics.v9i12.21966
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.6274

H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh, Are Bitvectors Optimal?, STOC'00, pp.1723-1744, 2002.
DOI : 10.1137/S0097539702405292

V. Chen, E. Grigorescu, and R. De-wolf, Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00455571

K. Efremenko, 3-query locally decodable codes of subexponential length, Proceedings of 41st ACM STOC, 2009.

I. Finocchi, F. Grandoni, and G. Italiano, Optimal Resilient Sorting and Searching in the Presence of Memory Faults, Proceedings of 33rd ICALP, pp.286-298, 2006.
DOI : 10.1007/11786986_26

I. Finocchi, F. Grandoni, and G. Italiano, Resilient search trees, Proceedings of 18th ACM-SIAM SODA, pp.547-553, 2007.

I. Finocchi and G. Italiano, Sorting and searching in the presence of memory faults (without redundancy), Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.101-110, 2004.
DOI : 10.1145/1007352.1007375

M. Fredman, M. Komlós, and E. Szemerédi, Storing a Sparse Table with 0(1) Worst Case Access Time, Journal of the ACM, vol.31, issue.3, pp.538-544, 1984.
DOI : 10.1145/828.1884

O. Goldreich, D. Ron, and M. Sudan, Chinese remaindering with errors, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1330-1338, 2000.
DOI : 10.1109/18.850672
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.4126

A. G. Jørgenson, G. Moruz, and T. Mølhave, Resilient priority queues, Proceedings of 10th International Workshop on Algorithms and Data Structures (WADS), 2007.

J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.80-86, 2000.
DOI : 10.1145/335305.335315

K. S. Kedlaya and C. Umans, Fast Modular Composition in any Characteristic, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.146-155, 2008.
DOI : 10.1109/FOCS.2008.13

I. Kerenidis and R. De-wolf, Exponential lower bound for 2-query locally decodable codes via a quantum argument, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.395-420, 2004.
DOI : 10.1145/780542.780560

P. B. Miltersen, On the cell probe complexity of polynomial evaluation, Theoretical Computer Science, vol.143, issue.1, pp.167-174, 1995.
DOI : 10.1016/0304-3975(95)80018-2

P. B. Miltersen, Cell probe complexity -a survey Invited paper at Advances in Data Structures workshop. Available at Miltersen's homepage, 1999.

R. De-wolf, Error-correcting data structures, Proceedings of 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2009), pp.313-324, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359651

D. Woodruff, New lower bounds for general locally decodable codes, 2006.

S. Yekhanin, Towards 3-query locally decodable codes of subexponential length, Earlier version in STOC'07, 2008.