Peter Mayr

Orcid: 0000-0003-1163-313X

Affiliations:
  • University of Colorado Boulder, CO, USA
  • University of Lisbon, Portugal (former)
  • University of Linz, Austria (former)


According to our database1, Peter Mayr authored at least 17 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Clonoids between modules.
Int. J. Algebra Comput., June, 2024

2023
On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite Algebras.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Small Promise CSPs that reduce to large CSPs.
Log. Methods Comput. Sci., 2022

2021
Small PCSPs that reduce to large CSPs.
CoRR, 2021

2020
Bounded homomorphisms and finitely generated fiber products of lattices.
Int. J. Algebra Comput., 2020

Sandwiches for Promise Constraint Satisfaction.
CoRR, 2020

2019
The Subpower Membership Problem for Finite Algebras with Cube Terms.
Log. Methods Comput. Sci., 2019

Generating subdirect products.
J. Lond. Math. Soc., 2019

2016
The subpower membership problem for semigroups.
Int. J. Algebra Comput., 2016

The subpower membership problem for semigroups.
CoRR, 2016

Quantified Constraint Satisfaction on Monoids.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
Independence of algebras with edge term.
Int. J. Algebra Comput., 2015

2012
The Subpower Membership Problem for Mal'cEV Algebras.
Int. J. Algebra Comput., 2012

2008
Polynomial Clones on Squarefree Groups.
Int. J. Algebra Comput., 2008

2005
A Topological Criterion for Polynomiality.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2001
Algorithms for Finite Near-rings and their N-groups.
J. Symb. Comput., 2001

2000
Algorithms for near-rings of non-linear transformations.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000


  Loading...