The Probabilistic Method ([AS]) is a lasting legacy of the late Paul Erdős. We give two examples – both problems first formulated by Erdős in the 1960s with new results in the last decade and both with substantial open questions. Further in both examples we take a Computer Science vantagepoint, creating a probabilistic algorithm to create the object (coloring, packing, respectively) and showing that with positive probability the created object has the desired properties. Given m sets each of size n (with an arbitrary intersection pattern) we want to color the underlying vertices Red and Blue so that no set is monochromatic. Erdős showed this may always be done if m< 2n−1 (proof: color randomly!). We give an argument of Srinivasan and Radhakrishnan ([RS]) that extends this to $m