Improved pseudorandom generators for combinatorial rectangles

Combinatorica

Volumn 22, Issue 3, 2002, Pages 417-434

  Lu, Chi Jen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036436290     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930200021     Document Type: Article

References (20)

1. N. Alon, L. Babai, and A. Itai: A fast and simple randomized parallel algorithm for the maximal independent set problem, Journal of Algorithms, 7 (1986), 567-583.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta: Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms, 3(3) (1992), 289-303.
3. P. Auer, P. Long, and A. Srinivasan: Approximating hyper-rectangles: learning and pseudo-random sets, Journal of Computer and System Sciences, 57 (1998), 376-388.
4. R. Armoni, M. Saks, A. Wigderson, and S. Zhou: Discrepancy sets and pseudorandom generators for combinatorial rectangles, In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 412-421, 1996.
5. S. Chari, P. Rohatgi, and A. Srinivasan: Improved algorithms via approximations of probability distributions, Journal of Computer and System Sciences, 61 (2000), 81-107.
6. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković: Approximations of general independent distributions, In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 10-16, 1992. Journal version appeared as the following.
7. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković: Efficient approximation of product distributions, Random Structures and Algorithms, 13(1) (1998), 1-16.
8. O. Goldreich and A. Wigderson: Tiny families of functions with random properties: a quality-size trade-off for hashing, Random Structures and Algorithms, 11(4) (1997), 315-343.
9. R. Impagliazzo, N. Nisan, and A. Wigderson: Pseudorandomness for network algorithms, In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 356-364, 1994.
10. R. Impagliazzo, R. Shaltiel, and A. Wigderson: Extractors and pseudo-random generators with optimal seed length, In: Proceedings of 32nd Symposium on Theory of Computing, 1-10, 2000.
11. N. Linial, M. Luby, M. Saks, and D. Zuckerman: Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Combinatorica, 17 (1997), 215-234.
12. M. Luby: A simple parallel algorithm for the maximal independent set problem, SIAM Journal on Computing, 15(4) (1986), 1036-1053.
13. J. Naor and M. Naor: Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing, 22(4) (1990), 838-856.
14. N. Nisan: Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), 449-461.
15. N. Nisan: Extracting randomness: how and why-a survey, In: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 44-58, 1996.
16. N. Nisan and D. Zuckerman: Randomness is linear in space, Journal of Computer and System Sciences, 52(1) (1996), 43-52.
17. R. Raz, O. Reingold, and S. Vadhan: Extracting all the randomness and reducing the error in Trevisan's extractors, In: Proceedings of 31st Symposium on Theory of Computing, 149-158, 1999.
18. J. Radhakrishnan and A. Ta-Shma: Private communication.
19. A. Ta-Shma, C. Umans, and D. Zuckerman: Loss-less condensers, unbalanced expanders, and extractors, to appear in Proceedings of 33rd Symposium on Theory of Computing, 2001.
20. L. Trevisan: Construction of extractors using pseudorandom generators, In: Proceedings of 31st Symposium on Theory of Computing, 141-148, 1999.