default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmin Weiß
Person information
- affiliation: University of Stuttgart, Institute for Formal Methods of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Markus Lohrey, Florian Stober
, Armin Weiß:
The Power Word Problem in Graph Products. Theory Comput. Syst. 68(3): 403-464 (2024)- [j13]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Equation Satisfiability in Solvable Groups. Theory Comput. Syst. 68(4): 740-757 (2024) - [c25]Stefan Funke, Daniel Koch, Claudius Proissl, Axel Schneewind, Armin Weiß, Felix Weitbrecht:
Scalable Ultrafast Almost-optimal Euclidean Shortest Paths. IJCAI 2024: 6716-6723 - [c24]Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß:
Constant Depth Circuit Complexity for Generating Quasigroups. ISSAC 2024: 198-207 - [c23]Caroline Mattes, Alexander Ushakov, Armin Weiß:
Complexity of Spherical Equations in Finite Groups. SOFSEM 2024: 383-397 - [i27]Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß:
On the Constant-Depth Circuit Complexity of Generating Quasigroups. CoRR abs/2402.00133 (2024) - [i26]Murray Elder, Adam Piggott, Florian Stober, Alexander Thumm, Armin Weiß:
Finite groups with geodetic Cayley graphs. CoRR abs/2406.00261 (2024) - 2023
- [j12]Caroline Mattes, Armin Weiß:
Parallel algorithms for power circuits and the word problem of the Baumslag group. Comput. Complex. 32(2): 10 (2023) - [j11]Jan Philipp Wächter, Armin Weiß:
An Automaton Group with PSPACE-Complete Word Problem. Theory Comput. Syst. 67(1): 178-218 (2023) - [c22]Florian Stober, Armin Weiß:
Lower Bounds for Sorting 16, 17, and 18 Elements. ALENEX 2023: 201-213 - [i25]Florian Stober, Armin Weiß:
Geodetic Graphs: Experiments and New Constructions. CoRR abs/2308.08970 (2023) - [i24]Caroline Mattes, Alexander Ushakov, Armin Weiß:
Complexity of Spherical Equations in Finite Groups. CoRR abs/2308.12841 (2023) - [i23]Piotr Kawalek, Armin Weiß:
Violating Constant Degree Hypothesis Requires Breaking Symmetry. CoRR abs/2311.17440 (2023) - 2022
- [j10]Alexei G. Myasnikov, Armin Weiß:
Parallel complexity for nilpotent groups. Int. J. Algebra Comput. 32(5): 895-928 (2022) - [j9]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): 1-41 (2022) - [c21]Florian Stober, Armin Weiß:
The Power Word Problem in Graph Products. DLT 2022: 286-298 - [c20]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Satisfiability Problems for Finite Groups. ICALP 2022: 127:1-127:20 - [c19]Caroline Mattes, Armin Weiß:
Improved Parallel Algorithms for Generalized Baumslag Groups. LATIN 2022: 658-675 - [c18]Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß:
The Isomorphism Problem for Plain Groups Is in Σ₃𝖯. STACS 2022: 26:1-26:14 - [i22]Florian Stober, Armin Weiß:
The Power Word Problem in Graph Products. CoRR abs/2201.06543 (2022) - [i21]Florian Stober, Armin Weiß:
Lower Bounds for Sorting 16, 17, and 18 Elements. CoRR abs/2206.05597 (2022) - 2021
- [c17]Caroline Mattes, Armin Weiß:
Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. MFCS 2021: 74:1-74:24 - [i20]Caroline Mattes, Armin Weiß:
Parallel algorithms for power circuits and the word problem of the Baumslag group. CoRR abs/2102.09921 (2021) - [i19]Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß:
The isomorphism problem for plain groups is in Σ3P. CoRR abs/2110.00900 (2021) - 2020
- [j8]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort: A Fast Sorting Scheme in Theory and Practice. Algorithmica 82(3): 509-588 (2020) - [j7]Florian Stober, Armin Weiß:
On the Average Case of MergeInsertion. Theory Comput. Syst. 64(7): 1197-1224 (2020) - [c16]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. CCC 2020: 29:1-29:29 - [c15]Armin Weiß:
Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. ICALP 2020: 102:1-102:19 - [c14]Jan Philipp Wächter, Armin Weiß:
An Automaton Group with PSPACE-Complete Word Problem. STACS 2020: 6:1-6:17 - [i18]Armin Weiß:
Hardness of equations over finite solvable groups under the exponential time hypothesis. CoRR abs/2002.10145 (2020) - [i17]Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß:
Equation satisfiability in solvable groups. CoRR abs/2010.11788 (2020)
2010 – 2019
- 2019
- [j6]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ACM J. Exp. Algorithmics 24(1): 1.4:1-1.4:22 (2019) - [j5]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): 809-832 (2019) - [c13]Stefan Edelkamp, Armin Weiß:
Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 1-14 - [c12]Florian Stober, Armin Weiß:
On the Average Case of MergeInsertion. IWOCA 2019: 417-429 - [c11]Markus Lohrey, Armin Weiß:
The Power Word Problem. MFCS 2019: 43:1-43:15 - [i16]Markus Lohrey, Armin Weiß:
The power word problem. CoRR abs/1904.08343 (2019) - [i15]Florian Stober, Armin Weiß:
On the Average Case of MergeInsertion. CoRR abs/1905.09656 (2019) - [i14]Jan Philipp Wächter, Armin Weiß:
An Automaton Group with PSPACE-Complete Word Problem. CoRR abs/1906.03424 (2019) - [i13]Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. CoRR abs/1909.13781 (2019) - 2018
- [c10]Géraud Sénizergues, Armin Weiß:
The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. ICALP 2018: 139:1-139:14 - [i12]Géraud Sénizergues, Armin Weiß:
The isomorphism problem for finite extensions of free groups is in PSPACE. CoRR abs/1802.07085 (2018) - [i11]Stefan Edelkamp, Armin Weiß:
QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting. CoRR abs/1804.10062 (2018) - [i10]Stefan Edelkamp, Armin Weiß:
Worst-Case Efficient Sorting with QuickMergesort. CoRR abs/1811.00833 (2018) - [i9]Stefan Edelkamp, Armin Weiß, Sebastian Wild:
QuickXsort - A Fast Sorting Scheme in Theory and Practice. CoRR abs/1811.01259 (2018) - 2017
- [j4]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. 83: 147-165 (2017) - [c9]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: 217-231 - [c8]Alexei G. Myasnikov, Armin Weiß:
TC0 Circuits for Algorithmic Problems in Nilpotent Groups. MFCS 2017: 23:1-23:14 - [i8]Alexei G. Myasnikov, Armin Weiß:
TC^0 circuits for algorithmic problems in nilpotent groups. CoRR abs/1702.06616 (2017) - 2016
- [j3]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica 76(4): 961-988 (2016) - [j2]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and Improved Analysis. Theory Comput. Syst. 59(2): 209-230 (2016) - [c7]Armin Weiß:
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups. AMS-EMS-SPM Joint Meeting 2016 - [c6]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. ESA 2016: 38:1-38:16 - [i7]Armin Weiß:
A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups. CoRR abs/1602.02445 (2016) - [i6]Stefan Edelkamp, Armin Weiß:
BlockQuicksort: How Branch Mispredictions don't affect Quicksort. CoRR abs/1604.06697 (2016) - [i5]Alexei Miasnikov, Svetla Vassileva, Armin Weiß:
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. CoRR abs/1612.05954 (2016) - 2015
- [b1]Armin Weiß:
On the complexity of conjugacy in amalgamated products and HNN extensions. University of Stuttgart, 2015 - [c5]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC 2015: 141-148 - [i4]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR abs/1501.05579 (2015) - 2014
- [c4]Stefan Edelkamp, Armin Weiß:
QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR 2014: 139-152 - [c3]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN 2014: 1-12 - 2013
- [j1]Volker Diekert, Armin Weiß:
Context-Free Groups and their Structure Trees. Int. J. Algebra Comput. 23(3): 611-642 (2013) - [c2]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and Improved Analysis. CSR 2013: 24-35 - [c1]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß:
Weak Heaps and Friends: Recent Developments. IWOCA 2013: 1-6 - [i3]Stefan Edelkamp, Armin Weiß:
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average. CoRR abs/1307.3033 (2013) - [i2]Volker Diekert, Alexei Miasnikov, Armin Weiß:
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR abs/1309.5314 (2013) - 2012
- [i1]Volker Diekert, Armin Weiß:
QuickHeapsort: Modifications and improved analysis. CoRR abs/1209.4214 (2012)
Coauthor Index
aka: Alexei Miasnikov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
