@InProceedings{	  dlu12higmanstacsSmall,
  author	= "Volker Diekert and J{\"u}rn Laun and Alexander Ushakov",
  title		= "Efficient algorithms for highly compressed data: {T}he
		  Word Problem in {H}igman's group is in {P}",
  booktitle	= "Proc.\ 29th International Symposium on Theoretical Aspects
		  of Computer Science, STACS 2012, Paris, France",
  year		= "2012",
  pages		= "218--229",
  publisher	= "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
  series	= "LIPIcs",
  volume	= "14",
  isbn		= "978-3-939897-35-4",
  doi		= "10.4230/LIPIcs.STACS.2012.218"
}