Improved algorithms via approximations of probability distributions

Authors:
Suresh Chari;Pankaj Rohatgi
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
2000

Citing 0
Cited 4

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Bounds and constructions for the star-discrepancy via δ-covers

Journal of Complexity
Bounds and constructions for the star-discrepancy via δ-covers

Journal of Complexity
Deterministic algorithms for the Lovász Local Lemma

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract