1. The complexity of modular graph automorphism;Arvind;SIAM Journal on Computing,2000
2. Computing largest common point sets under approximate congruence;Ambühl,2000
3. On determining the congruence of point sets in d dimensions;Akutsu;Computational Geometry,1998
4. Proofs from THE BOOK;Aigner,2010
5. Làszlò Babai, Character sums, Weil’s estimates and paradoxical tournaments. http://people.cs.uchicago.edu/~laci/reu02.dir/paley.pdf.