Armin Weiß

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 56

Top Venues

University of Stuttgart (PHD)

Education History

University of Stuttgart

PHD

Publications

Markus Lohrey, Florian Stober, Armin Weiß
The Power Word Problem in Graph Products. Theory Comput. Syst. 68 (3) (2024)
Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß
Constant Depth Circuit Complexity for Generating Quasigroups. ISSAC (2024)
Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß
On the Constant-Depth Circuit Complexity of Generating Quasigroups. CoRR (2024)
Murray Elder, Adam Piggott, Florian Stober, Alexander Thumm, Armin Weiß
Finite groups with geodetic Cayley graphs. CoRR (2024)
Caroline Mattes, Alexander Ushakov, Armin Weiß
Complexity of Spherical Equations in Finite Groups. SOFSEM (2024)
Jan Philipp Wächter, Armin Weiß
An Automaton Group with PSPACE-Complete Word Problem. Theory Comput. Syst. 67 (1) (2023)
Florian Stober, Armin Weiß
Lower Bounds for Sorting 16, 17, and 18 Elements. ALENEX (2023)
Caroline Mattes, Alexander Ushakov, Armin Weiß
Complexity of Spherical Equations in Finite Groups. CoRR (2023)
Florian Stober, Armin Weiß
Geodetic Graphs: Experiments and New Constructions. CoRR (2023)
Caroline Mattes, Armin Weiß
Parallel algorithms for power circuits and the word problem of the Baumslag group. Comput. Complex. 32 (2) (2023)
Piotr Kawalek, Armin Weiß
Violating Constant Degree Hypothesis Requires Breaking Symmetry. CoRR (2023)
Alexei G. Myasnikov, Armin Weiß
Parallel complexity for nilpotent groups. Int. J. Algebra Comput. 32 (5) (2022)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM Trans. Comput. Theory 14 (3-4) (2022)
Caroline Mattes, Armin Weiß
Improved Parallel Algorithms for Generalized Baumslag Groups. LATIN (2022)
Florian Stober, Armin Weiß
Lower Bounds for Sorting 16, 17, and 18 Elements. CoRR (2022)
Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß
Satisfiability Problems for Finite Groups. ICALP (2022)
Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
. STACS (2022)
Florian Stober, Armin Weiß
The Power Word Problem in Graph Products. CoRR (2022)
Florian Stober, Armin Weiß
The Power Word Problem in Graph Products. DLT (2022)
Caroline Mattes, Armin Weiß
Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. MFCS (2021)
Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
. CoRR (2021)
Caroline Mattes, Armin Weiß
Parallel algorithms for power circuits and the word problem of the Baumslag group. CoRR (2021)
Florian Stober, Armin Weiß
On the Average Case of MergeInsertion. Theory Comput. Syst. 64 (7) (2020)
Armin Weiß
Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. ICALP (2020)
Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß
Equation satisfiability in solvable groups. CoRR (2020)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82 (3) (2020)
Armin Weiß
Hardness of equations over finite solvable groups under the exponential time hypothesis. CoRR (2020)
Jan Philipp Wächter, Armin Weiß
An Automaton Group with PSPACE-Complete Word Problem. STACS (2020)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. Computational Complexity Conference (2020)
Jan Philipp Wächter, Armin Weiß
An Automaton Group with PSPACE-Complete Word Problem. CoRR (2019)
Markus Lohrey, Armin Weiß
The power word problem. CoRR (2019)
Alexei Miasnikov, Svetla Vassileva, Armin Weiß
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. Theory Comput. Syst. 63 (4) (2019)
Florian Stober, Armin Weiß
On the Average Case of MergeInsertion. CoRR (2019)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ACM J. Exp. Algorithmics 24 (1) (2019)
Markus Lohrey, Armin Weiß
The Power Word Problem. MFCS (2019)
Florian Stober, Armin Weiß
On the Average Case of MergeInsertion. IWOCA (2019)
Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR (2019)
Stefan Edelkamp, Armin Weiß
Worst-Case Efficient Sorting with QuickMergesort. ALENEX (2019)
Stefan Edelkamp, Armin Weiß
Worst-Case Efficient Sorting with QuickMergesort. CoRR (2018)
Stefan Edelkamp, Armin Weiß
QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. CoRR (2018)
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR (2018)
Géraud Sénizergues, Armin Weiß
The isomorphism problem for finite extensions of free groups is in PSPACE. CoRR (2018)
Géraud Sénizergues, Armin Weiß
The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. ICALP (2018)
Alexei G. Myasnikov, Armin Weiß
TC^0 circuits for algorithmic problems in nilpotent groups. CoRR (2017)
Alexei G. Myasnikov, Armin Weiß
Circuits for Algorithmic Problems in Nilpotent Groups. MFCS (2017)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. 83 (2017)
Alexei Miasnikov, Svetla Vassileva, Armin Weiß
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$. CSR (2017)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: How Branch Mispredictions don't affect Quicksort. CoRR (2016)
Stefan Edelkamp, Armin Weiß
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ESA (2016)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and Improved Analysis. Theory Comput. Syst. 59 (2) (2016)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica 76 (4) (2016)
Armin Weiß
A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups. CoRR (2016)
Armin Weiß
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups. AMS-EMS-SPM Joint Meeting (2016)
Alexei Miasnikov, Svetla Vassileva, Armin Weiß
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. CoRR (2016)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC (2015)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR (2015)
Stefan Edelkamp, Armin Weiß
QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR (2014)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN (2014)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and Improved Analysis. CSR (2013)
Volker Diekert, Alexei Miasnikov, Armin Weiß
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR (2013)
Volker Diekert, Armin Weiß
Context-Free Groups and their Structure Trees. Int. J. Algebra Comput. 23 (3) (2013)
Stefan Edelkamp, Armin Weiß
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA (2013)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and improved analysis CoRR (2012)

Armin Weiß.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Armin Weiß