Approximations of general independent distributions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 10-16

  Even, Guy ^a   Goldreicht, Oded ^a   Luby, Michael ^b   Nisan, Noam ^c   Velickovic, Boban ^d  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROBABILITY DISTRIBUTIONS; RANDOM VARIABLES; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBABILITY; RANDOM PROCESSES;

DERANDOMIZING; EFFICIENT CONSTRUCTION; HIGH DIMENSIONAL SPACES; PROBABILITY SPACES; RANDOMIZED ALGORITHMS;

APPROXIMATION THEORY; RANDOM NUMBER GENERATION;

DERANDOMIZATION; GENERAL RANDOM VARIABLES; INDEPENDENT DISTRIBUTIONS; SMALL SAMPLE SPACES;

EID: 0027004045     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129714     Document Type: Conference Paper

References (15)

1. Alon, N., Babai, L., Itai, A., "A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem", Journal of Algorithms, 7, pp. 567-583, 1986.
2. Alon, N., Goldreich, O., Hâstad, J., Peralta, R., "Simple Constructions of Almost fc-wise Independent Random Variables", Proc. 31st FOCS, 1990.
3. Azar, Y., Motwani, R., Naor, J., "An efficient construction of a multiple value small bias probability space", to appear.
4. Beck, J., Chen, W., "Irregularities of distribution", Cambridge University Press, 1987.
5. Chor,B., Freidmann, J., Goldreich, O., Hâstad, J., Rudich, S., Smolensky, R., "The bit extraction problem and i-resilient functions", Proc. 26th FOCS, 1985, pp. 396-407
6. Chor, B., Goldreich, O., "On the Power of Two-Point Based Sampling," Jour, of Complexity, Vol 5, 1989, pp. 96-106.
7. Even, G., "Construction of Small Probabilistic Spaces for Deterministic Simulation", M. Sc. (in Computer Science) thesis, submitted to the Senate of the Technion (Israel Institute of Technology) in Aug. 1991. (In Hebrew, abstract in English).
8. Karp, R., Wigderson, A., "A Fast Parallel Algorithm for the Maximal Independent Set Problem", proceedings of 16th ACM Symposium on Theory of Computing, 1984.
9. Knuth, D., Yao, A., "The complexity of non uniform random number generation", in Algorithms and Complexity, Ed. J. Traub, AC Press, New York, pp. 357-428, 1976.
10. Linial, N., Nisan, N., "Approximate Inclusion-Exclusion", 22nd STOC, 1990.
11. Luby, M., "A Simple Parallel Algorithm for the Maximal Independent Set Problem," 17th STOC, May 6-8 1985, pp. 1-10, SIAM J. on Computing, November 1986, Volume 15, No. 4, pp. 1036-1053
12. Luby, M., Velickovic, B., "On Deterministic Approximation of DNF", Proc. 23rd STOC, 1991, pp. 430-438.
13. Naor, J., Naor, M., "Small-bias Probability Spaces: Efficient Constructions and Applications", 22nd STOC, 1990, pp. 213-223.
14. Nisan, N., "Pseudo-random Generators for Space-Bounded Computation", 22nd STOC, May 14-16 1990, pp. 204-212.
15. Niederreiter, H., "Constructions of Low-Discrepancy Point Sets and Sequences", manuscript and lecture notes.