László Zádori

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2024 J jnl
Representations of Finite Groups by Posets of Small Height.
Order
Gergo Gyenizse, Péter Hajnal, László Zádori
2024 J jnl
Taylor is prime.
Int. J. Algebra Comput.
Bertalan Bodor, Gergo Gyenizse, Miklós Maróti, László Zádori
2023 J jnl
On the use of majority for investigating primeness of 3-permutability.
Int. J. Algebra Comput.
Gergo Gyenizse, Miklós Maróti, László Zádori
2022 J jnl
Critical Relations of Crowns in Critical Times of Coronavirus Depression.
Order
Ádám Kunos, Miklós Maróti, László Zádori
2021 J jnl
Congruence permutability is prime.
CoRR
Gergo Gyenizse, Miklós Maróti, László Zádori
2020 J jnl
n-Permutability is not join-prime for n ≥ 5.
Int. J. Algebra Comput.
Gergo Gyenizse, Miklós Maróti, László Zádori
2019 J jnl
Computing Version Spaces in the Qualitative Approach to Multicriteria Decision Aid.
Int. J. Found. Comput. Sci.
Miguel Couceiro, Miklós Maróti, Tamás Waldhauser, László Zádori
2019 J jnl
Correction to: On Finite Generability of Clones of Finite Posets.
Order
Ádám Kunos, Miklós Maróti, László Zádori
2019 J jnl
On Finite Generability of Clones of Finite Posets.
Order
Ádám Kunos, Miklós Maróti, László Zádori
2013 J jnl
A special case of the Stahl conjecture.
Eur. J. Comb.
János Kincses, Géza Makay, Miklós Maróti, József Osztényi, László Zádori
2012 J jnl
Reflexive digraphs with near unanimity polymorphisms.
Discret. Math.
Miklós Maróti, László Zádori
2010 J jnl
A combinatorial constraint satisfaction problem dichotomy classification conjecture.
Eur. J. Comb.
Jaroslav Nesetril, Mark H. Siggers, László Zádori
2009 J jnl
Omitting Types, Bounded Width and the Ability to Count.
Int. J. Algebra Comput.
Benoît Larose, Matthew Valeriote, László Zádori
2007 J jnl
Solvability of Systems of Polynomial Equations over Finite Algebras.
Int. J. Algebra Comput.
László Zádori
2006 J jnl
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.
Int. J. Algebra Comput.
Benoît Larose, László Zádori
2005 J jnl
A polynomial-time algorithm for near-unanimity graphs.
J. Algorithms
Benoît Larose, Cynthia Loten, László Zádori
2003 J jnl
The Complexity of the Extendibility Problem for Finite Posets.
SIAM J. Discret. Math.
Benoît Larose, László Zádori
2001 J jnl
Idempotent Totally Symmetric Operations on Finite Posets.
Order
Csaba Szabó, László Zádori
1997 J jnl
Algebraic properties and dismantlability of finite posets.
Discret. Math.
Benoît Larose, László Zádori
1997 J jnl
Relational Sets and Categorical Equivalence of Algebras.
Int. J. Algebra Comput.
László Zádori
1989 J jnl
A Note on the Relations Between Critical and Sensitive Complexity.
J. Inf. Process. Cybern.
Ingo Wegener, László Zádori