László Babai, Thomas P. Hayes. Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pages 1057-1066, SIAM, 2005. [doi]
@inproceedings{BabaiH05,
title = {Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group},
author = {László Babai and Thomas P. Hayes},
year = {2005},
doi = {10.1145/1070432.1070584},
url = {http://doi.acm.org/10.1145/1070432.1070584},
researchr = {https://researchr.org/publication/BabaiH05},
cites = {0},
citedby = {0},
pages = {1057-1066},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005},
publisher = {SIAM},
isbn = {0-89871-585-7},
}