![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Erhard Aichinger
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Erhard Aichinger
, Simon Grünbacher, Paul Hametner:
Zero testing and equation solving for sparse polynomials on rectangular domains. Finite Fields Their Appl. 95: 102379 (2024) - [c4]Bernardo Rossi, Erhard Aichinger:
On NP-Complete Search Problems on Finite Algebras. ISMVL 2024: 131-136 - 2023
- [c3]Erhard Aichinger
, Simon Grünbacher:
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term. STACS 2023: 4:1-4:12 - 2022
- [j8]Erhard Aichinger
, Nebojsa Mudrinski:
Finite representation of commutator sequences. Int. J. Algebra Comput. 32(8): 1513-1543 (2022) - 2020
- [j7]Erhard Aichinger
, Gábor Horváth:
Congruence preserving expansions of nilpotent algebras. Int. J. Algebra Comput. 30(1): 167-179 (2020)
2010 – 2019
- 2019
- [c2]Erhard Aichinger
:
Solving Systems of Equations in Supernilpotent Algebras. MFCS 2019: 72:1-72:9 - 2018
- [j6]Erhard Aichinger
, Nebojsa Mudrinski, Jakub Oprsal
:
Complexity of term representations of finitary functions. Int. J. Algebra Comput. 28(6): 1101-1118 (2018) - 2016
- [j5]Erhard Aichinger
, Rika Yatchak:
Sonata: a GAP tool for nearring computations. ACM Commun. Comput. Algebra 50(3): 89-92 (2016) - 2015
- [j4]Erhard Aichinger
, Peter Mayr
:
Independence of algebras with edge term. Int. J. Algebra Comput. 25(7): 1145-1157 (2015) - 2013
- [j3]Erhard Aichinger
, Nebojsa Mudrinski:
Sequences of Commutator Operations. Order 30(3): 859-867 (2013)
2000 – 2009
- 2006
- [j2]Erhard Aichinger
, Jürgen Ecker:
Every (k+1)-affine Complete Nilpotent Group of Class K Is Affine Complete. Int. J. Algebra Comput. 16(2): 259-274 (2006) - 2005
- [j1]Erhard Aichinger
:
A Bound on The Number of Unary Polynomial Functions and a Decidability Result for Near-Rings. Int. J. Algebra Comput. 15(2): 279-289 (2005) - 2000
- [c1]Franz Binder, Erhard Aichinger
, Jürgen Ecker, Christof Nöbauer, Peter Mayr:
Algorithms for near-rings of non-linear transformations. ISSAC 2000: 23-29
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-07 02:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint