[1]   László Babai: Graph isomorphism in quasipolynomial time. Technical report, 2015. [arXiv:1512.03547]

[2]   Daniel Gorenstein: Finite Groups. AMS Chelsea Publ., 1980. 2nd ed.

[3]   Tim Gowers: Comment on Dick Lipton’s blog entry “The Group isomorphism Problem: A Possible Polymath Problem?”. Blog entry started November 7, 2011. Comment cited: November 12, 2011. http://rjlipton.wordpress.com/2011/11/07/the-group-isomorphism-problem-a-possible-polymath-problem/.

[4]   Eugene M. Luks: Group isomorphism with fixed subnormal chains. Technical report, 2015. [arXiv:1511.00151]

[5]   David Rosenbaum: Bidirectional collision detection and faster algorithms for isomorphism problems. Technical report, 2013. [arXiv:1304.3935]

[6]   David Rosenbaum: Breaking the n^{log n} barrier for solvable-group isomorphism. In Proc. 24th ACM–SIAM Symp. Discrete Algorithms (SODA’13), pp. 1054–1073, 2013. [doi:10.1137/1.9781611973105.76, arXiv:1205.0642]

[7]   David Rosenbaum and Fabian Wagner: Breaking the generator-enumeration bound for p-group isomorphism. Theoret. Comput. Sci., pp. 16–25, 2015. [doi:10.1016/j.tcs.2015.05.036, arXiv:1312.1755]