Increasing the output length of zero-error dispersers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 430-443

  Gabizon, Ariel ^a   Shaltiel, Ronen ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY;

COMBINATORIAL OP-TIMIZATION PROBLEM; FINITE SETS;

APPROXIMATION ALGORITHMS;

EID: 51849117297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_34     Document Type: Conference Paper

References (34)

1. Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. SIAM J. Comput 36(4), 1095-1118 (2006)
2. Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: New consturctions of condenesers, ramsey graphs, dispersers, and extractors. In: STOC 2005, pp. 1-10 (2005)
3. Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In: STOC 2006, pp. 671-680 (2006)
4. Ben-Or, M., Linial, N.: Collective coin flipping. ADVCR: Advances in Computing Research 5, 91-115 (1989)
5. Blum, M.: Independent unbiased coin flips from a correlated biased source-a finite stae markov chain. Combinatorica 6(2), 97-108 (1986)
6. Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory 1, 1-32
7. Bourgain, J.: On the construction of affine extractors. Geometric And Functional Analysis 17(1), 33-57 (2007)
8. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing 17(2), 230-261 (1988); Special issue on cryptography
9. Chor, B., Goldreich, O., Hastad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: FOCS 1985, pp. 396-407 (1985)
10. Cohen, A., Wigderson, A.: Dispersers, deterministic amplification and weak random sources. In: FOCS 1989, pp. 14-25 (1989)
11. Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J., Ron, D. (eds.) RANDOM 2004. LNCS, vol. 3122, pp. 334-344. Springer, Heidelberg (2004)
12. Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. In: FOCS 2007, pp. 52-62 (2007)
13. Fiat, A., Naor, M.: Implicit O(1) probe search. SICOMP: SIAM Journal on Computing 22 (1993)
14. Gabizon, A., Raz, R.: Deterministic extractors for affine sources over large fields. In: FOCS 2005, pp. 407-418 (2005)
15. Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SICOMP: SIAM Journal on Computing 36(4), 1072-1094 (2006)
16. Goldreich, O.: A sample of samplers - A computational perspective on sampling (survey). In: ECCCTR: Electronic Colloquium on Computational Complexity, technical reports (1997)
17. Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. Wiley, Chichester (1980)
18. Guruswami, V., Umans, C., Vadhan, S.P.: Unbalanced expanders and randomness extractors from parvaresh-vardy codes. In: CCC 2007, pp. 96-108 (2007)
19. Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: STOC 2006, pp. 691-700 (2006)
20. Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM J. Comput. 36(5), 1231-1247 (2007)
21. Lu, C., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: STOC 2003, pp. 602-611 (2003)
22. Mossel, E., Umans, C.: On the complexity of approximating the vc dimension. In: CCC 2001, pp. 220-225 (2001)
23. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-52 (1996)
24. Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics 13(1), 2-24 (2000)
25. Rao, A.: Extractors for a constant number of polynomially small min-entropy independent sources. In: STOC 2006, pp. 497-506 (2006)
26. Rao, A.: Extractors for low weight affine sources (unpublished manuscript) (2008)
27. Raz, R.: Extractors with weak random seeds. In: STOC 2005, pp. 11-20 (2005)
28. Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences 33, 75-87 (1986)
29. Shaltiel, R.: How to get more mileage from randomness extractors. In: CCC 2006, pp. 46-60 (2006)
30. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67-95 (2002)
31. Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: FOCS 2000, pp. 32-42 (2000)
32. Vazirani, U.: Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources. Combinatorica 7, 375-392 (1987)
33. von Neumann, J.: Various techniques used in connection with random digits. Applied Math Series 12, 36-38 (1951)
34. Yao, A.C.-C.: Should tables be sorted? J. ACM 28(3), 615-628 (1981)