The fourth moment method

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 373-383

  Berger, Bonnie ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ABSOLUTE VALUES; ACYCLIC SUBGRAPH; COMBINATORIAL BOUNDS; COMBINATORIAL METHOD; HIGHER MOMENTS; LOWER BOUNDS; MATHEMATICAL INEQUALITY; POSITIVE PROBABILITY;

METHOD OF MOMENTS;

EID: 84936052593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

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:567-583, 1987.
2. B. Berger. Data structures for removing randomness. Technical Report MIT/LCS/TR-436, Lab. for Computer Science, MIT, Cambridge, MA, December 1988.
3. B. Berger. Using Randomness to Design Efficient Deterministic Algorithms. PhD thesis, EECS, MIT, Cambridge, MA, May 1990.
4. c n)-wise independence in NC. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 2-7. IEEE, October 1989. Also Journal of the ACM, to appear.
5. B. Berger and P. Shor. Approximation algorithms for the maximum acyclic subgraph problem. In Proceedings of the First Annual A CM/SIA M Symposium on Discrete Algorithms, pages 236-243. ACM/SIAM, January 1990.
6. W. Fernandez De La Vega. On the maximum cardinality of a consistent set of arcs in a random tournament. Journal of Combinatorial Theory, B: 35:328-332, 1983.
7. R. Greenlaw. The parallel complexity of approximation algorithms for the acyclic subgraph problem. Technical Report 90-61, Dept. of Computer Science, U. of New Hampshire, Durham, NH, February 1990.
8. G. Hardy, J. E. Littlewood, and G. Polya. Inequalities. Cambridge Mathematical Library, Cambridge, MA, 1988.
9. A. Joffe. On a set of almost deterministic kindependent random variables. Annals of Probability, 2:161-162, 1974.
10. R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. Journal of the ACM, 32(4):762-773, October 1985.
11. R. H. Lathrop, R. J. Hall, and Robert S. Kirk. Functional abstraction from structure in VLSI simulation models. In Proceedings of the 24th IEEE/ACM Design Automation Conference, pages 822-828, Miami Beach, FL, June 1987. IEEE/ACM.
12. J. Leung, 1989. Private communication.
13. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1053, November 1986.
14. M. Luby. Removing randomness in parallel computation without a processor penalty. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 162-173. IEEE, October 1988.
15. R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 8-13. IEEE, October 1989.
16. S. Polgak, V. Rödl, and J. Spencer. Tournament ranking with expected profit in polynomial time. SIAM Journal of Discrete Mathematics, 1:372-376, 1988.
17. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37(4):130-143, October 1988.
18. V. Ramachandran. Finding a minimum feedback arc set in reducible flow graphs. Journal of Algorithms, 9(3):299-313, September 1988.
19. I. R. Savage. Probability inequalities of the Tchebycheff type. Journal of Research of the National Bureau of Standards, 65 B (3):211-222, 1972.
20. M. H. Shirley. Generating circuit tests by exploiting designed behavior. Technical Report MIT/AI/TR-1099, MIT Artificial Intelligence Laboratory, Cambridge, MA, December 1988.
21. J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, PA, 1987.
22. J. Spencer and P. Tetali. Private communication.