Laun, Jürn Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P. (English) Zbl 1319.68112 Theory Comput. Syst. 55, No. 4, 742-770 (2014). MSC: 68Q25 20F10 68P05 68P30 68Q15 PDFBibTeX XMLCite \textit{J. Laun}, Theory Comput. Syst. 55, No. 4, 742--770 (2014; Zbl 1319.68112) Full Text: DOI arXiv
Diekert, Volker; Laun, Jürn; Ushakov, Alexander Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. (English) Zbl 1264.20034 Int. J. Algebra Comput. 22, No. 8, Paper No. 1240008, 19 p. (2012). MSC: 20F10 68Q25 68P05 68P30 68Q15 PDFBibTeX XMLCite \textit{V. Diekert} et al., Int. J. Algebra Comput. 22, No. 8, Paper No. 1240008, 19 p. (2012; Zbl 1264.20034) Full Text: DOI
Diekert, Volker; Laun, Jürn; Ushakov, Alexander Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. (English) Zbl 1245.68103 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 218-229, electronic only (2012). MSC: 68Q25 20F10 68P05 68P30 68Q15 PDFBibTeX XMLCite \textit{V. Diekert} et al., LIPIcs -- Leibniz Int. Proc. Inform. 14, 218--229 (2012; Zbl 1245.68103) Full Text: DOI arXiv