Dispencery in different numbers of colors
Discrete Mathematics
Recursive Randomized Coloring Beats Fair Dice Random Colorings
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Balanced Coloring: Equally Easy for All Numbers of Colors?
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved bounds and schemes for the declustering problem
Theoretical Computer Science
Hi-index | 0.00 |