Last update: Sat Oct 14 02:35:45 MDT 2017
@Article{Domanski:1985:CDA, author = "B. Domanski and M. Anshel", title = "The complexity of {Dehn}'s algorithm for word problems in groups", journal = j-J-ALG, volume = "6", number = "4", pages = "543--549", month = dec, year = "1985", CODEN = "JOALDV", DOI = "https://doi.org/10.1016/0196-6774(85)90031-8", ISSN = "0196-6774 (print), 1090-2678 (electronic)", ISSN-L = "0196-6774", bibdate = "Tue Dec 11 09:14:23 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib", URL = "http://www.sciencedirect.com/science/article/pii/0196677485900318", acknowledgement = ack-nhfb, fjournal = "Journal of Algorithms", journal-URL = "http://www.sciencedirect.com/science/journal/01966774", }