1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
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.