László Zádori

According to our database, László Zádori authored at least 20 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Taylor is prime.

Bertalan Bodor, Gergo Gyenizse, Miklós Maróti, László Zádori

Int. J. Algebra Comput., September, 2024

2023

On the use of majority for investigating primeness of 3-permutability.

Gergo Gyenizse, Miklós Maróti, László Zádori

Int. J. Algebra Comput., February, 2023

2022

Critical Relations of Crowns in Critical Times of Coronavirus Depression.

Ádám Kunos, Miklós Maróti, László Zádori

Order, 2022

2021

Congruence permutability is prime.

Gergo Gyenizse, Miklós Maróti, László Zádori

CoRR, 2021

2020

n-Permutability is not join-prime for n ≥ 5.

Gergo Gyenizse, Miklós Maróti, László Zádori

Int. J. Algebra Comput., 2020

2019

Correction to: On Finite Generability of Clones of Finite Posets.

Ádám Kunos, Miklós Maróti, László Zádori

Order, 2019

On Finite Generability of Clones of Finite Posets.

Ádám Kunos, Miklós Maróti, László Zádori

Order, 2019

Computing Version Spaces in the Qualitative Approach to Multicriteria Decision Aid.

Miguel Couceiro, Miklós Maróti, Tamás Waldhauser, László Zádori

Int. J. Found. Comput. Sci., 2019

2013

A special case of the Stahl conjecture.

János Kincses, Géza Makay, Miklós Maróti, József Osztényi, László Zádori

Eur. J. Comb., 2013

2012

Reflexive digraphs with near unanimity polymorphisms.

Miklós Maróti, László Zádori

Discret. Math., 2012

2010

A combinatorial constraint satisfaction problem dichotomy classification conjecture.

Jaroslav Nesetril, Mark H. Siggers, László Zádori

Eur. J. Comb., 2010

2009

Omitting Types, Bounded Width and the Ability to Count.

Benoît Larose, Matthew Valeriote, László Zádori

Int. J. Algebra Comput., 2009

2007

Solvability of Systems of Polynomial Equations over Finite Algebras.

László Zádori

Int. J. Algebra Comput., 2007

2006

Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.

Benoît Larose, László Zádori

Int. J. Algebra Comput., 2006

2005

A polynomial-time algorithm for near-unanimity graphs.

Benoît Larose, Cynthia Loten, László Zádori

J. Algorithms, 2005

2003

The Complexity of the Extendibility Problem for Finite Posets.

Benoît Larose, László Zádori

SIAM J. Discret. Math., 2003

2001

Idempotent Totally Symmetric Operations on Finite Posets.

Csaba Szabó, László Zádori

Order, 2001

1997

Relational Sets and Categorical Equivalence of Algebras.

László Zádori

Int. J. Algebra Comput., 1997

Algebraic properties and dismantlability of finite posets.

Benoît Larose, László Zádori

Discret. Math., 1997

1989

A Note on the Relations Between Critical and Sensitive Complexity.

Ingo Wegener, László Zádori

J. Inf. Process. Cybern., 1989