Bild mit Unilogo
homeicon uni sucheicon suche kontakticon kontakt impressicon impressum
unilogo Universität Stuttgart 
Institut für Formale Methoden der Informatik

Abteilung Theoretische Informatik

 

Laun


2013:

Efficient algorithms for highly compressed data: The word problem in Higman's group is in P

Volker Diekert, Jürn Laun, Alexander Ushakov

International Journal of Algebra and Computation, Volume 22, Number 8, World Scientific, 2013.
[© World Scientific] [arxiv:1103.1232v1]

2012:

Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P

Volker Diekert, Jürn Laun, Alexander Ushakov

Proceedings of the Symposium on Theoretical Aspects of Computer Science 2012 (STACS), 2012.
[pdf File on LIPIcs]

Efficient Algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P

Jürn Laun

Preprint, 2012.
[arXiv:1207.6944v2]

2011:

On Computing Geodesics in Baumslag-Solitar Groups

Volker Diekert, Jürn Laun

International Journal of Algebra and Computation, Volume 21, Pages 119-145, Number 1-2, World Scientific, 2011.
[arxiv:0907.5114v2] [© World Scientific]