László Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 684-697, ACM, 2016. [doi]
@inproceedings{Babai16, title = {Graph isomorphism in quasipolynomial time [extended abstract]}, author = {László Babai}, year = {2016}, doi = {10.1145/2897518.2897542}, url = {http://doi.acm.org/10.1145/2897518.2897542}, researchr = {https://researchr.org/publication/Babai16}, cites = {0}, citedby = {0}, pages = {684-697}, booktitle = {Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016}, editor = {Daniel Wichs and Yishay Mansour}, publisher = {ACM}, isbn = {978-1-4503-4132-5}, }