Obserwuj
Armin Weiß
Armin Weiß
Zweryfikowany adres z fmi.uni-stuttgart.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Blockquicksort: Avoiding branch mispredictions in quicksort
S Edelkamp, A Weiß
Journal of Experimental Algorithmics (JEA) 24, 1-22, 2019
252019
Context-free groups and their structure trees
V Diekert, A Weiß
International Journal of Algebra and Computation 23 (03), 611-642, 2013
252013
Hyperbolic structures on surfaces and geodesic currents
J Aramayona, V Diekert, CJ Leininger, PV Silva, A Weiß, J Aramayona, ...
Algorithmic and geometric topics around free groups and automorphisms, 111-149, 2017
232017
Context-free groups and Bass-Serre theory
V Diekert, A Weiß
Algorithmic and geometric topics around free groups and automorphisms, 43-110, 2017
212017
An automaton group with PSPACE-complete word problem
JP Wächter, A Weiß
Theory of Computing Systems 67 (1), 178-218, 2023
192023
TC^ 0 circuits for algorithmic problems in nilpotent groups
A Myasnikov, A Weiß
arXiv preprint arXiv:1702.06616, 2017
162017
QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average
S Edelkamp, A Weiß
International Computer Science Symposium in Russia, 139-152, 2014
162014
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits
V Diekert, AG Myasnikov, A Weiß
LATIN 2014: Theoretical Informatics: 11th Latin American Symposium …, 2014
162014
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
A Weiß
Algebra and computer science 677, 185-212, 2016
142016
Hardness of equations over finite solvable groups under the exponential time hypothesis
A Weiß
arXiv preprint arXiv:2002.10145, 2020
132020
Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits
V Diekert, AG Myasnikov, A Weiß
Algorithmica 76, 961-988, 2016
132016
QuickXsort: A fast sorting scheme in theory and practice
S Edelkamp, A Weiß, S Wild
Algorithmica 82 (3), 509-588, 2020
122020
The power word problem
M Lohrey, A Weiß
arXiv preprint arXiv:1904.08343, 2019
122019
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
V Diekert, A Myasnikov, A Weiß
Proceedings of the 2015 ACM on International Symposium on Symbolic and …, 2015
122015
On the complexity of conjugacy in amalgamated products and HNN extensions
A Weiß
122015
Blockquicksort: How branch mispredictions don't affect quicksort
S Edelkamp, A Weiß
arXiv preprint arXiv:1604.06697, 2016
112016
QuickHeapsort: Modifications and improved analysis
V Diekert, A Weiß
Theory of Computing Systems 59, 209-230, 2016
102016
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
L Bartholdi, M Figelius, M Lohrey, A Weiß
ACM Transactions on Computation Theory 14 (3-4), 1-41, 2023
92023
Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems
L Bartholdi, M Figelius, M Lohrey, A Weiß
35th Computational Complexity Conference (CCC 2020), 2020
92020
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0
A Miasnikov, S Vassileva, A Weiß
Theory of Computing Systems 63 (4), 809-832, 2019
92019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20