@Article{	  LaunTOCS2013,
  year		= "2013",
  issn		= "1432-4350",
  journal	= "Theory of Computing Systems",
  doi		= "10.1007/s00224-013-9509-5",
  title		= "Efficient algorithms for highly compressed data: {T}he
		  word problem in {H}igman's group is in {P}",
  url		= "http://dx.doi.org/10.1007/s00224-013-9509-5",
  publisher	= "Springer US",
  keywords	= "Data structures; Compression; Algorithmic group theory;
		  Word problem",
  author	= "Laun, J{\"u}rn",
  pages		= "1-29",
  language	= "English"
}