J. Radhakrishnan and A. Ta-shma, Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators, SIAM Journal on Discrete Mathematics, vol.13, issue.1, pp.2-24, 2000.
DOI : 10.1137/S0895480197329508

O. Reingold, R. Shaltiel, and A. Wigderson, Extracting Randomness via Repeated Condensing, SIAM Journal on Computing, vol.35, issue.5, pp.1185-1209, 2006.
DOI : 10.1137/S0097539703431032

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.7751

H. Buhrman, L. Fortnow, and S. Laplante, Resource-Bounded Kolmogorov Complexity Revisited, SIAM Journal on Computing, vol.31, issue.3, pp.887-905, 2002.
DOI : 10.1137/S009753979834388X

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6456

M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 1997.

D. Musatov, Extractors and an effective variant of Muchnik's theorem. Diplom (Master thesis) Faculty of Mechanics and Mathematics, MSU, p.3958, 2006.

. A. An and . Muchnik, On basic structures of the descriptive theory of algorithms, Soviet Math. Dokl, vol.32, pp.671-674, 1985.

. An and . Muchnik, Conditional complexity and codes, Theoretical Computer Science, vol.271, issue.12, pp.97-109, 2002.

A. Shen, Combinatorial proof of Muchnik's theorem, Dagstuhl Seminar Proceedings 06051, 2006.

H. Buhrman, T. Lee, and D. Van-melkebeek, Language compression and pseudorandom generators, Proc. of the 15th IEEE Conference on Computational Complexity, pp.228-255, 2004.
DOI : 10.1007/s00037-005-0199-5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7637

L. Trevisan, Construction of extractors using pseudo-random generators, Proc. 31 Annual ACM Symposium on Theory of Computing, pp.141-148, 1999.

D. Slepian and J. K. Wolf, Noiseless coding of correlated information sources, IEEE Transactions on Information Theory, vol.19, issue.4, pp.471-480, 1973.
DOI : 10.1109/TIT.1973.1055037

N. Nisan and A. Wigderson, Hardness vs randomness, Journal of Computer and System Sciences, vol.49, issue.2, pp.149-167, 1994.
DOI : 10.1016/S0022-0000(05)80043-1

URL : http://doi.org/10.1016/s0022-0000(05)80043-1

M. Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound, Journal of Complexity, vol.13, issue.1, pp.180-193, 1997.
DOI : 10.1006/jcom.1997.0439

O. Goldreich, Three XOR-Lemmas ??? An Exposition, 1995.
DOI : 10.1145/359340.359342

M. Sipser, A complexity theoretic approach to randomness, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.330-335, 1983.
DOI : 10.1145/800061.808762