J\"urn Laun
Identifiers
- name variant J\"urn Laun 0.60 · backfill
Papers (3)
- Efficient algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P math.GR · 2012 · author #1
- Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P math.GR · 2011 · author #2
- On Computing Geodesics in Baumslag-Solitar Groups math.GR · 2009 · author #2
Mentions
Frequent Coauthors
- Volker Diekert 2 shared papers
- Alexander Ushakov 1 shared papers