Armin Weiß - RankMe

76 papers A* 5A 8B 8C 3Misc 3Journal 47Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Efficient Compression in Semigroups. STACS Alexander Thumm, Armin Weiß
2026	J	`jnl`	Efficient Compression in Semigroups. CoRR Alexander Thumm, Armin Weiß
2026	J	`jnl`	Obstruction theory and the complexity of counting group homomorphisms. CoRR Eric Samperton, Armin Weiß
2026	J	`jnl`	The complexity of finding coset-generating polymorphisms and the promise metaproblem. CoRR Manuel Bodirsky, Armin Weiß
2025	A*	`conf`	Membership and Conjugacy in Inverse Semigroups. ICALP Lukas Fleischer, Florian Stober, Alexander Thumm, Armin Weiß
2025	J	`jnl`	Membership and Conjugacy in Inverse Semigroups. CoRR Lukas Fleischer, Florian Stober, Alexander Thumm, Armin Weiß
2025	J	`jnl`	On the Constant-Depth Circuit Complexity of Generating Quasigroups. TheoretiCS Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß
2025	J	`jnl`	On the complexity of epimorphism testing with virtually abelian targets. CoRR Murray Elder, Jerry Shen, Armin Weiß
2025	A	`conf`	Violating Constant Degree Hypothesis Requires Breaking Symmetry. STACS Piotr Kawalek, Armin Weiß
2024	B	`conf`	Complexity of Spherical Equations in Finite Groups. SOFSEM Caroline Mattes, Alexander Ushakov, Armin Weiß
2024	B	`conf`	Constant Depth Circuit Complexity for Generating Quasigroups. ISSAC Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß
2024	J	`jnl`	Equation Satisfiability in Solvable Groups. Theory Comput. Syst. Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß
2024	J	`jnl`	Finite groups with geodetic Cayley graphs. CoRR Murray Elder, Adam Piggott, Florian Stober, Alexander Thumm, Armin Weiß
2024	J	`jnl`	On the Constant-Depth Circuit Complexity of Generating Quasigroups. CoRR Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß
2024	A*	`conf`	Scalable Ultrafast Almost-optimal Euclidean Shortest Paths. IJCAI Stefan Funke, Daniel Koch, Claudius Proissl, Axel Schneewind, Armin Weiß, Felix Weitbrecht
2024	J	`jnl`	The Power Word Problem in Graph Products. Theory Comput. Syst. Markus Lohrey, Florian Stober, Armin Weiß
2023	J	`jnl`	An Automaton Group with PSPACE-Complete Word Problem. Theory Comput. Syst. Jan Philipp Wächter, Armin Weiß
2023	J	`jnl`	Complexity of Spherical Equations in Finite Groups. CoRR Caroline Mattes, Alexander Ushakov, Armin Weiß
2023	J	`jnl`	Geodetic Graphs: Experiments and New Constructions. CoRR Florian Stober, Armin Weiß
2023	A	`conf`	Lower Bounds for Sorting 16, 17, and 18 Elements. ALENEX Florian Stober, Armin Weiß
2023	J	`jnl`	Parallel algorithms for power circuits and the word problem of the Baumslag group. Comput. Complex. Caroline Mattes, Armin Weiß
2023	J	`jnl`	Violating Constant Degree Hypothesis Requires Breaking Symmetry. CoRR Piotr Kawalek, Armin Weiß
2022	J	`jnl`	Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. ACM Trans. Comput. Theory Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2022	B	`conf`	Improved Parallel Algorithms for Generalized Baumslag Groups. LATIN Caroline Mattes, Armin Weiß
2022	J	`jnl`	Lower Bounds for Sorting 16, 17, and 18 Elements. CoRR Florian Stober, Armin Weiß
2022	J	`jnl`	Parallel complexity for nilpotent groups. Int. J. Algebra Comput. Alexei G. Myasnikov, Armin Weiß
2022	A*	`conf`	Satisfiability Problems for Finite Groups. ICALP Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß
2022	A	`conf`	The Isomorphism Problem for Plain Groups Is in Σ₃ STACS Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
2022	C	`conf`	The Power Word Problem in Graph Products. DLT Florian Stober, Armin Weiß
2022	J	`jnl`	The Power Word Problem in Graph Products. CoRR Florian Stober, Armin Weiß
2021	B	`conf`	Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. MFCS Caroline Mattes, Armin Weiß
2021	J	`jnl`	Parallel algorithms for power circuits and the word problem of the Baumslag group. CoRR Caroline Mattes, Armin Weiß
2021	J	`jnl`	The isomorphism problem for plain groups is in Σ CoRR Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß
2020	A	`conf`	An Automaton Group with PSPACE-Complete Word Problem. STACS Jan Philipp Wächter, Armin Weiß
2020	J	`jnl`	Equation satisfiability in solvable groups. CoRR Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß
2020	A	`conf`	Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. CCC Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2020	A*	`conf`	Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. ICALP Armin Weiß
2020	J	`jnl`	Hardness of equations over finite solvable groups under the exponential time hypothesis. CoRR Armin Weiß
2020	J	`jnl`	On the Average Case of MergeInsertion. Theory Comput. Syst. Florian Stober, Armin Weiß
2020	J	`jnl`	QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica Stefan Edelkamp, Armin Weiß, Sebastian Wild
2019	J	`jnl`	An Automaton Group with PSPACE-Complete Word Problem. CoRR Jan Philipp Wächter, Armin Weiß
2019	J	`jnl`	BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ACM J. Exp. Algorithmics Stefan Edelkamp, Armin Weiß
2019	J	`jnl`	Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß
2019	C	`conf`	On the Average Case of MergeInsertion. IWOCA Florian Stober, Armin Weiß
2019	J	`jnl`	On the Average Case of MergeInsertion. CoRR Florian Stober, Armin Weiß
2019	J	`jnl`	The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. Theory Comput. Syst. Alexei Miasnikov, Svetla Vassileva, Armin Weiß
2019	B	`conf`	The Power Word Problem. MFCS Markus Lohrey, Armin Weiß
2019	J	`jnl`	The power word problem. CoRR Markus Lohrey, Armin Weiß
2019	A	`conf`	Worst-Case Efficient Sorting with QuickMergesort. ALENEX Stefan Edelkamp, Armin Weiß
2018	J	`jnl`	QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. CoRR Stefan Edelkamp, Armin Weiß
2018	J	`jnl`	QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR Stefan Edelkamp, Armin Weiß, Sebastian Wild
2018	A*	`conf`	The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. ICALP Géraud Sénizergues, Armin Weiß
2018	J	`jnl`	The isomorphism problem for finite extensions of free groups is in PSPACE. CoRR Géraud Sénizergues, Armin Weiß
2018	J	`jnl`	Worst-Case Efficient Sorting with QuickMergesort. CoRR Stefan Edelkamp, Armin Weiß
2017	J	`jnl`	Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2017	B	`conf`	TC MFCS Alexei G. Myasnikov, Armin Weiß
2017	J	`jnl`	TC^0 circuits for algorithmic problems in nilpotent groups. CoRR Alexei G. Myasnikov, Armin Weiß
2017	Misc	`conf`	The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$. CSR Alexei Miasnikov, Svetla Vassileva, Armin Weiß
2016	J	`jnl`	A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups. CoRR Armin Weiß
2016	—	`conf`	A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups. AMS-EMS-SPM Joint Meeting Armin Weiß
2016	A	`conf`	BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ESA Stefan Edelkamp, Armin Weiß
2016	J	`jnl`	BlockQuicksort: How Branch Mispredictions don't affect Quicksort. CoRR Stefan Edelkamp, Armin Weiß
2016	J	`jnl`	Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2016	J	`jnl`	QuickHeapsort: Modifications and Improved Analysis. Theory Comput. Syst. Volker Diekert, Armin Weiß
2016	J	`jnl`	The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. CoRR Alexei Miasnikov, Svetla Vassileva, Armin Weiß
2015	B	`conf`	Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2015	J	`jnl`	Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2015	—	`—`	On the complexity of conjugacy in amalgamated products and HNN extensions. Armin Weiß
2014	B	`conf`	Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN Volker Diekert, Alexei G. Myasnikov, Armin Weiß
2014	Misc	`conf`	QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR Stefan Edelkamp, Armin Weiß
2013	J	`jnl`	Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR Volker Diekert, Alexei Miasnikov, Armin Weiß
2013	J	`jnl`	Context-Free Groups and their Structure Trees. Int. J. Algebra Comput. Volker Diekert, Armin Weiß
2013	Misc	`conf`	QuickHeapsort: Modifications and Improved Analysis. CSR Volker Diekert, Armin Weiß
2013	J	`jnl`	QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR Stefan Edelkamp, Armin Weiß
2013	C	`conf`	Weak Heaps and Friends: Recent Developments. IWOCA Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
2012	J	`jnl`	QuickHeapsort: Modifications and improved analysis CoRR Volker Diekert, Armin Weiß