Abstract: A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. I will provide an overview of the work that has been done on finding the automorphism groups of circulant (di)graphs, along with some history on the origins of this problem.