A Note on the Relations Between Critical and Sensitive Complexity. - Ingo Wegener; László Zádori (J. Inf. Process. Cybern., 1989)

Algebraic properties and dismantlability of finite posets. - Benoît Larose; László Zádori (Discret. Math., 1997)

Relational Sets and Categorical Equivalence of Algebras. - László Zádori (Int. J. Algebra Comput., 1997)

Idempotent Totally Symmetric Operations on Finite Posets. - Csaba Szabó; László Zádori (Order, 2001)

The Complexity of the Extendibility Problem for Finite Posets. - Benoît Larose; László Zádori (SIAM J. Discret. Math., 2003)

A polynomial-time algorithm for near-unanimity graphs. - Benoît Larose; Cynthia Loten; László Zádori (J. Algorithms, 2005)

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)

Solvability of Systems of Polynomial Equations over Finite Algebras. - László Zádori (Int. J. Algebra Comput., 2007)

Omitting Types, Bounded Width and the Ability to Count. - Benoît Larose; Matthew Valeriote; László Zádori (Int. J. Algebra Comput., 2009)

A combinatorial constraint satisfaction problem dichotomy classification conjecture. - Jaroslav Nesetril; Mark H. Siggers; László Zádori (Eur. J. Comb., 2010)

Reflexive digraphs with near unanimity polymorphisms. - Miklós Maróti; László Zádori (Discret. Math., 2012)

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)

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)

On Finite Generability of Clones of Finite Posets. - Ádám Kunos; Miklós Maróti; László Zádori (Order, 2019)

Correction to: On Finite Generability of Clones of Finite Posets. - Ádám Kunos; Miklós Maróti; László Zádori (Order, 2019)

n-Permutability is not join-prime for n ≥ 5. - Gergo Gyenizse; Miklós Maróti; László Zádori (Int. J. Algebra Comput., 2020)

Congruence permutability is prime. - Gergo Gyenizse; Miklós Maróti; László Zádori (CoRR, 2021)

Critical Relations of Crowns in Critical Times of Coronavirus Depression. - Ádám Kunos; Miklós Maróti; László Zádori (Order, 2022)

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., 2023)

Taylor is prime. - Bertalan Bodor; Gergo Gyenizse; Miklós Maróti; László Zádori (Int. J. Algebra Comput., 2024)

Representations of Finite Groups by Posets of Small Height. - Gergo Gyenizse; Péter Hajnal; László Zádori (Order, 2024)