@Article{	  ddm12,
  author	= "Diekert, Volker and Duncan, Andrew J. and Myasnikov,
		  Alexei G.",
  title		= "Cyclic rewriting and conjugacy problems",
  journal	= "Groups Complexity Cryptology",
  volume	= "4",
  number	= "2",
  year		= "2012",
  pages		= "321--355",
  bibsource	= "DBLP, http://dblp.uni-trier.de",
  abstract	= "Cyclic words are equivalence classes of cyclic
		  permutations of ordinary words. When a group is given by a
		  rewriting relation, a rewriting system on cyclic words is
		  induced, which is used to construct algorithms to find
		  minimal length elements of conjugacy classes in the group.
		  These techniques are applied to the universal groups of
		  Stallings pregroups and in particular to free products with
		  amalgamation, HNN-extensions and virtually free groups, to
		  yield simple and intuitive algorithms and proofs of
		  conjugacy criteria.",
  doi		= "10.1515/gcc-2012-0020"
}