Volker Diekert, Jürn Laun, Alexander Ushakov. Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 218-229, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]
Abstract is missing.