J. Naor
M. Naor
References
- 1.M. Ajtai and A. Wigderson, Deterministic simulation of probabilistic constant depth computation, FOCS '85, pp. 11-19. Google Scholar
Digital Library
- 2.M. Ajtai, J. Komlos and E. Szemeredi, Deterministic simulation in LOGSPACE, STOC '87, pp. 132-140. Google ScholarDigital Library
- 3.N. Alon, Explicit constructions of exponential sized families of k-independent sets, Discrete Math, 58, pp. 191-193 (1986). Google ScholarDigital Library
- 4.N. Alon, L. Babai and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. of Alg., 7, pp. 567-583 (1986). Google ScholarDigital Library
- 5.E. Bach, Realistic analysis of some randomized algorithms, STOC '87, pp. 453-461. Google ScholarDigital Library
- 6.R. Ben-Nathan, M.Sc. Thesis, Hebrew University (1990).Google Scholar
- 7.M. Blum and R. Kannan, Designing programs that check their work, STOC '89, pp. 86-97. Google ScholarDigital Library
- 8.B. Berger and J. Rompel, Simulating (log c n)-wise independence in NC, FOCS '89 pp. 2-7. Google ScholarDigital Library
- 9.B. Chor and O. Goldreich, On the power of twopoint based sampling, J. of Complexity, 5, pp. 96-106 (1989). Google ScholarDigital Library
- 10.B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich and R. Smolensky, The bit extraction problem or t-resilient functions, FOCS '85, pp. 396-407. Google ScholarDigital Library
- 11.A. Cohen and A. Wigderson, Dispersers, deterministic amplification and weak random sources, FOCS '89, pp. 14-19. Google ScholarDigital Library
- 12.A. Cohen and A. Wigderson, Multigraph Amplification, Survey (1989).Google Scholar
- 13.W. Feller, An Introduction to probability theory and its applications, John Wiley, 1968.Google Scholar
- 14.R. Freivalds, Fast probabilistic algorithms, Springer Verlag Lecture Notes in CS #74, Mathematical Foundations of CS, pp. 57-69 (1979).Google Scholar
- 15.O. Gaber and Z. Galil, Explicit construction of linear size superconcentrators, JCSS, 22, p. 407 (1981).Google ScholarCross Ref
- 16.R. Impagliazzo and D. Zuckerman, Recycling random bits, FOCS '89, pp. 248-253. Google ScholarDigital Library
- 17.S. Jimbo and A. Marouka Expanders obtained from affine transformations, STOC '85. Google ScholarDigital Library
- 18.J. Justesen, A class of asymptotically good algebraic codes, IEEE trans. Infor. Theory, 18 (1972) 652-656.Google ScholarDigital Library
- 19.R. Karp and N. Pippenger, A time randomness tradeoff, AMS conference on probabilistic computation and complexity, Durham NC, (1983).Google Scholar
- 20.H. Karloff and P. Raghavan, Randomized algorithms and pseudorandom numbers, STOC '88, pp. 310-321. Google ScholarDigital Library
- 21.H. Karloff and D. Shmoys, Efficient parallel algorithms for edge coloring problems, 3. of Alg., Yol. 8 (1987), pp. 39-52. Google ScholarDigital Library
- 22.R. M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, JACM, 32 (1985), pp. 762-773. Google ScholarDigital Library
- 23.A. Lubotzky, R. Phillips and P. Sarnak, Explicit expanders and the Ramanujan conjecture, STOC '86. Google ScholarDigital Library
- 24.M. Luby, A simple parallel algorithm for the maximal independent set problem, SICOMP, 15, pp. 1036-1053 (1986). Google ScholarDigital Library
- 25.R. Motwani, J. Naor and M. Naor, The probabilistic method yields deterministic parallel algorithms, FOCS '89, pp. 8-13. Google ScholarDigital Library
- 26.F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North Holland, Amsterdam, 1977.Google Scholar
- 27.N. Nisan and A. Wigderson, Hardness vs. Randomness, FOCS '88, pp. 2-11. Google ScholarDigital Library
- 28.R. Peralta, On the randomness complexity of algorithms, University of Wisconsin, Milwaukee, CS Research Report TR 90-1.Google Scholar
- 29.P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, JCSS, 37 (1988), pp. 130-143. Google ScholarDigital Library
- 30.R. Rivest, A. Shamir and L. Adelman, CACM (1978).Google Scholar
- 31.M. Santha, On using deterministic functions to reduce randomness in probabilistic algorithms, Information and Computation 74, pp. 241-249 (1987). Google ScholarDigital Library
- 32.G. Seroussi and N. Bshouti, Vector sets for exhaustive testing of logic circuits, IEEE Trans. on Info. Theory, vol. 34, pp. 513-522 (1988).Google ScholarDigital Library
- 33.M. Sipser, Expanders, randomness, or time versus space, 3CSS, Vol. 36, pp. 379-383 (1988). Google ScholarDigital Library
- 34.J. Spencer, Ten lectures on the probabilistic method. SIAM (Philadelphia), 1987.Google Scholar
- 35.V. Vazirani, Randomness, adversaries and computation, Ph.D. Thesis, University of California, Berkeley (1986). Google ScholarDigital Library
Index Terms
Small-bias probability spaces: efficient constructions and applications
Comments