( en | de | ru )

 

Disambiguation of "Weiß, Armin"

Author of the publication

copydeleteadd this publication to your clipboard
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0.

, , and . Theory Comput. Syst., 63 (4): 809-832 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Armin Weiß

Armin Weiß

Robert Armin

Gerhard Arminger

Peter Armin

 

Other publications of authors with the same name

An Automaton Group with PSPACE-Complete Word Problem., and . STACS, volume 154 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)QuickXsort: A Fast Sorting Scheme in Theory and Practice., , and . Algorithmica, 82 (3): 509-588 (2020)Lower Bounds for Sorting 16, 17, and 18 Elements., and . ALENEX, page 201-213. SIAM, (2023)NaGe bei hohen Drücken auch im NaPb-Typ, , , and . Angewandte Chemie, 97 (6): 499--500 (1985)The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0., , and . Theory Comput. Syst., 63 (4): 809-832 (2019)Parallel complexity for nilpotent groups., and . Int. J. Algebra Comput., 32 (5): 895-928 (2022)Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group., and . MFCS, volume 202 of LIPIcs, page 74:1-74:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems., , , and . CoRR, (2019)Worst-Case Efficient Sorting with QuickMergesort., and . ALENEX, page 1-14. SIAM, (2019)Parallel algorithms for power circuits and the word problem of the Baumslag group., and . Comput. Complex., 32 (2): 10 (December 2023)