Fault tolerant data structures, Proceedings of 37th Conference on Foundations of Computer Science, pp.580-589, 1996. ,
DOI : 10.1109/SFCS.1996.548517
Optimal resilient dynamic dictionaries General constructions for information-theoretical Private Information Retrieval, Proceedings of 15th ESA, pp.347-358247, 2005. ,
Are Bitvectors Optimal?, SIAM Journal on Computing, vol.31, issue.6, pp.1723-1744, 2002. ,
DOI : 10.1137/S0097539702405292
Selective private function evaluation with applications to private statistics, Proceedings of 20th ACM PODC, pp.293-304, 2001. ,
Resilient search trees, Proceedings of 18th ACM- SIAM SODA, pp.547-553, 2007. ,
Sorting and searching in the presence of memory faults (without redundancy) Storing a sparse table with O(1) worst case access time, Proceedings of 36th ACM STOC, pp.101-110538, 1984. ,
Resilient priority queues, Proceedings of 10th WADSKN97] E. Kushilevitz and N. Nisan. Communication Complexity, 1997. ,
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
Exponential lower bound for 2-query locally decodable codes via a quantum argument, Proceedings of 26th ACM STOC Invited paper at Advances in Data Structures workshop. Available at Miltersen's homepage, pp.395-420, 1977. ,
DOI : 10.1016/j.jcss.2004.04.007
The quantum complexity of set membership Some applications of coding theory in computational complexity Storing information with extractors, Quaderni di MatematicavL98] J. H. van Lint. Introduction to Coding Theory Proceedings of 39th ACM STOC, pp.462-479347, 1981. ,