László Zádori

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 7

Top Topics

Top Venues

Int. J. Algebra Comput.

Int. J. Found. Comput. Sci.

Publications

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