Equitable colorings extend Chernoff-Hoeffding bounds

Authors:
Sriram V. Pemmaraju
Affiliations:
Department of Computer Science, The University of Iowa, Iowa City, IA
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 1
Cited 3

Randomized algorithms

Randomized algorithms

Equitable colorings with constant number of colors

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the set systems used for broadcast encryption

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract