Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Mayr 0001
Person information
- affiliation: University of Colorado Boulder, CO, USA
- affiliation (former): University of Lisbon, Portugal
- affiliation (former): University of Linz, Austria
Other persons with the same name
- Peter Mayr 0002 — Apple Computer GmbH, Munich, Germany
- Peter Mayr 0003 — University of Saint Gallen, Switzerland
- Peter Mayr 0004 — Duale Hochschule Baden-Württemberg Mannheim, Germany
- Peter Mayr 0005 — flussbau iC, Villach, Austria
- Peter Mayr 0006
![[0000-0003-2530-4644]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2530-4644")
— Technical University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c4]Peter Mayr:
On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite Algebras. MFCS 2023: 66:1-66:12- 2022
- [j9]Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small Promise CSPs that reduce to large CSPs. Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [i4]Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small PCSPs that reduce to large CSPs. CoRR abs/2109.07924 (2021) - 2020
- [j8]William J. DeMeo, Peter Mayr, Nik Ruskuc:
Bounded homomorphisms and finitely generated fiber products of lattices. Int. J. Algebra Comput. 30(04): 693-710 (2020) - [i3]Guofeng Deng, Ezzeddine El Sai, Trevor Manders, Peter Mayr, Poramate Nakkirt, Athena Sparks:
Sandwiches for Promise Constraint Satisfaction. CoRR abs/2003.07487 (2020)
2010 – 2019
- 2019
- [j7]Peter Mayr, Nik Ruskuc:
Generating subdirect products. J. Lond. Math. Soc. 100(2): 404-424 (2019) - [j6]Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [i2]Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. CoRR abs/1803.08019 (2018) - 2016
- [j5]Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl:
The subpower membership problem for semigroups. Int. J. Algebra Comput. 26(7): 1435-1451 (2016) - [c3]Hubie Chen, Peter Mayr:
Quantified Constraint Satisfaction on Monoids. CSL 2016: 15:1-15:14 - [i1]Andrei Bulatov, Peter Mayr, Markus Steindl:
The subpower membership problem for semigroups. CoRR abs/1603.09333 (2016) - 2015
- [j4]Erhard Aichinger, Peter Mayr:
Independence of algebras with edge term. Int. J. Algebra Comput. 25(7): 1145-1157 (2015) - 2012
- [j3]Peter Mayr:
The Subpower Membership Problem for Mal'cEV Algebras. Int. J. Algebra Comput. 22(7) (2012)
2000 – 2009
- 2008
- [j2]Peter Mayr:
Polynomial Clones on Squarefree Groups. Int. J. Algebra Comput. 18(4): 759-777 (2008) - 2005
- [c2]Günter Landsmann, Peter Mayr, Josef Schicho:
A Topological Criterion for Polynomiality. Algorithmic Algebra and Logic 2005: 155-158 - 2001
- [j1]Franz Binder, Peter Mayr:
Algorithms for Finite Near-rings and their N-groups. J. Symb. Comput. 32(1/2): 23-38 (2001) - 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
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-04-25 01:41 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:
