1 paper
Mark C. Bell, Saul Schleimer
We give an O(nlog3(n))-time algorithm for the word problem in the mapping class group of a compact surface.