Improved algorithms via approximations of probability distributions

Journal of Computer and System Sciences

Volumn 61, Issue 1, 2000, Pages 81-107

  Chari, Suresh ^a   Rohatgi, Pankaj ^a   Srinivasan, Aravind ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBABILITY DISTRIBUTIONS;

DERANDOMIZATION; GRAPH COLORING;

PARALLEL ALGORITHMS;

EID: 0034249052     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1695     Document Type: Article

References (39)

1. Alexi W., Chor B., Goldreich O., Schnorr C. P. RSA/Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17:1988;194-209.
2. Alon N., Babai L., Itai A. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms. 7:1986;567-583.
3. Alon N., Bruck J., Naor J., Naor M., Roth R. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inform. Theory. 38:1992;509-516.
4. Alon N., Goldreich O., Håstad J., Peralta R. Simple constructions of almost k-wise independent random variables. Random Structures Algorithms. 3:1992;289-303.
5. Alon N., Naor M. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica. 16:1996;434-449.
6. Alon N., Srinivasan A. Improved parallel approximation of a class of integer programming problems. Algorithmica. 17:1997;449-462.
7. Armoni R., Saks M., Wigderson A., Zhou S. Discrepancy sets and pseudorandom generators for combinatorial rectangles. Proc. IEEE Symposium on Foundations of Computer Science. 1996;. p. 412-421.
8. 4/3. Proc. ACM Symposium on Theory of Computing. 1997;. p. 230-239.
9. Auer P., Long P. M., Srinivasan A. Approximating hyper-rectangles: learning and pseudo-random sets. J. Comput. System Sci. 57:1998;376-388.
10. Beck J., Chen W. Irregularities of Distribution. 1987;Cambridge University Press, Cambridge.
11. Berger B. The fourth moment method. SIAM J. Comput. 26:1997;1188-1207.
12. c n)-wise independence in NC. J. Assoc. Comput. Mach. 38:1991;1026-1046.
13. Berger B., Shor P. W. Tight bounds for the maximum acyclic subgraph problem. J. Algorithms. 25:1997;1-18.
14. Blum M., Micali S. How to generate cryptographically strong sequences of random bits. SIAM J. Comput. 13:1984;850-864.
15. Chazelle B., Matoušek J. On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms. 21:1996;579-597.
16. Chor B., Friedman J., Goldreich O., Hastad J., Rudich S., Smolensky R. The bit extraction problem or t-resilient functions. Proc. IEEE Symposium on Foundations of Computer Science. 1985;. p. 396-407.
17. Chor B., Goldreich E. On the power of two-point based sampling. J. Complexity. 5:1989;96-106.
18. Even G., Goldreich O., Luby M., Nisan N., Veličković B. Approximations of general independent distributions. Proc. ACM Symposium on Theory of Computing. 1992;. p. 10-16.
19. Ferrenberg A. M., Landau D. P., Wong Y. J. Monte Carlo simulations: Hidden errors from "good" random number generators. Phys. Rev. Lett. 69:1992;3382-3384.
20. Han Y. A fast derandomization scheme and its applications. SIAM J. Comput. 25:1996;52-82.
21. Hsu T.-s. Graph Augmentation and Related Problems: Theory and Practice. October 1993;University of Texas at AustinDepartment of Computer Sciences.
22. Hsu T.-s., Ramachandran V., Dean N. Parallel implementation of algorithms for finding connected components. DIMACS International Algorithm Implementation Challenge. 1994;. p. 1-14.
23. Joffe A. On a set of almost deterministic k-independent random variables. Ann. Probab. 2:1974;161-162.
24. Karloff H. J., Raghavan P. Randomized algorithms and pseudorandom numbers. Assoc. Comput. Mach. 40:1993;454-476.
25. Karp R. M., Ramachandran V. A survey of parallel algorithms for shared memory machines. Van Leeuwen J. Handbook of Theoretical Computer Science. 1990;871-941 MIT Press, Cambridge.
26. Karp R. M., Wigderson A. A fast parallel algorithm for the maximal independent set problem. J. Assoc. Comput. Mach. 32:1985;762-773.
27. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15:1986;1036-1053.
28. Luby M. Removing randomness in parallel computation without a processor penalty. Proc. IEEE Symposium on the Foundation of Computer Science. 1988;. p. 162-173.
29. Luby M. Removing randomness in parallel computation without a processor penalty. J. Comput. System Sci. 47:1993;250-286.
30. Mahajan S., Ramos E. A., Subrahmanyam K. V. Solving some discrepancy problems in NC. Proc. Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. 1346:1997;Springer-Verlag, Berlin. p. 22-36.
31. Motwani R., Naor J., Naor M. The probabilistic method yields deterministic parallel algorithms. J. Comput. System Sci. 49:1994;478-516.
32. Naor J., Naor M. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22:1993;838-856.
33. 1.5 n) space. Proc. IEEE Symposium on Foundations of Computer Science. 1992;. p. 24-29.
34. Panconesi A., Srinivasan A. The local nature of Δ-colorings and its algorithmic applications. Combinatorica. 15:1995;255-280.
35. Raghavan P. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37:1988;130-143.
36. Schmidt J. P., Siegel A., Srinivasan A. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math. 8:1995;223-250.
37. Spencer J. H. Balancing vectors in the max norm. Combinatorica. 6:1986;55-65.
38. Spencer J. H. Ten Lectures on the Probabilistic Method. 1987;SIAM, Philadelphia.
39. Yao A. C. C. Theory and application of trapdoor functions. Proc. IEEE Symposium on Foundations of Computer Science. 1982;. p. 80-91.