@InProceedings{diekert_et_al:LIPIcs.STACS.2012.218,
author = {Diekert, Volker and Laun, J\"{u}rn and Ushakov, Alexander},
title = {{Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {218--229},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {D\"{u}rr, Christoph and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.218},
URN = {urn:nbn:de:0030-drops-34204},
doi = {10.4230/LIPIcs.STACS.2012.218},
annote = {Keywords: Algorithmic group theory, Data structures, Compression, Word Problem}
}