[1] Zádori, L; Generation of finite partition lattices pdf

Universal algebra, Colloq., Szeged/Hung. 1983, Colloq. Math. Soc. János Bolyai 43, 573-586, North-Holland, 1986.

 

[2] Zádori, L; A Legendre-szimbólum egy megközelítése Cayley reprezentációs tételének segítségével pdf

Sectio Scentae Naturalis, Series Nova, Tomus I., 23-27, Szeged, Hungaria, 1987.(in Hungarian)

 

[3] Zádori, L; A Boolean function optimization for cellular microprogram generation

Proc. of the Third International Workshop on Parallel Processing by Cellular Automata Arrays, pp. 90-93, North Holland, 1987.

 

[4] Wegener, I; Zádori, L; A note on the relations between critical and sensitive complexity pdf

J. Inf. Process. Cybern. 25, No.8/9, 417-421 (1989).

 

[5] Zádori, L; Order varieties generated by finite posets pdf

 Order 8, No.4, 341-348 (1992).

 

[6] Zádori, L; Posets, near unanimity functions and zigzags pdf

 Bull. Aust. Math. Soc. 47, No.1, 79-93 (1993).

 

[7] Zádori, L; Series parallel posets with nonfinitely generated clones pdf

Order 10, No.4, 305-316 (1993).

 

[8] Zádori, L; Monotone Jónsson operations and near unanimity functions pdf

Algebra Univers. 33, No.2, 216-236 (1995).

 

[9] Zádori, L; Natural duality via a finite set of relations pdf

Bull. Aust. Math. Soc. 51, No.3, 469-478 (1995).

 

[10] Larose, B; Zádori, L; Algebraic properties and dismantlability of finite posets pdf

Discrete Math. 163, No.1-3, 89-99 (1997).

 

[11] Zádori, L; Relational sets and categorical equivalence of algebras pdf

Int. J. Algebra Comput. 7, No.5, 561-576 (1997).

 

[12] Zádori, L; Categorical equivalence of finite groups pdf

Bull. Aust. Math. Soc. 56, No.3, 403-408 (1997).

 

[13] Zádori, L; Characterizing finite irreducible relational sets pdf

Acta Sci. Math. 64, No.3-4, 455-462 (1998).

 

[14] Czédli, G; Zádori, L; (editors), Conference on lattices and universal algebra pdf

Algebra Univers. 45, 2001.

 

[15] Szabó, Cs; Zádori, L; Idempotent totally symmetric operations on finite posets pdf

Order 18, 39-47, (2001).

 

[16] Larose, B; Zádori, L; The complexity of the extendibility problem for finite posets pdf

SIAM J.Discrete Math., 17 (1), 114-121 (2003).

 

[17] Larose, B; Zádori, L; Finite posets and topological spaces in locally finite varieties pdf

Algebra Universalis, 52, no. 2-3, 119-136 (2004).

 

[18] Larose, B; Loten, C; Zádori, L; A polynomial-time algorithm for near-unanimity graphs pdf

J. Algorithms, 55, no. 2, 177-191, (2005).

 

[19] Larose, B; Zádori, L; Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras pdf

Internat. J. Algebra Comput. 16, no. 3, 563-581, (2006)

 

[20] Larose, B; Zádori, L; Bounded width problems and algebras pdf

Algebra Universalis, Volume 56, no. 3-4, 439-466 (2007)

 

[21] Zádori, L; Solvability of systems of polynomial equations over finite algebras pdf

Internat. J. Algebra Comput Vol 17, no. 4 821-835, (2007)

 

[22] Zádori, L; Subspace lattices of finite vector spaces are 5-generated pdf

 Acta Sci. Math. (Szeged) 74, 491-497 (2008)

 

[23] Larose, B; Valeriote, M; Zádori, L; Omitting types, bounded width and the ability to count pdf

Internat. J. Algebra Comput.19, no. 5, 647–668 (2009)

 

[24] Nešetřil, J; Siggers, M; Zádori, L; A combinatorial CSP dichotomy classification conjecture pdf

European Journal of Combinatorics 31, no. 1, 280-296 (2010)

 

[25] Zádori, L; On solvability of systems of polynomial equations pdf

Algebra Universalis 65, no. 3, 277-283 (2011)

 

[26] Maróti, M; Zádori, L; Reflexive digraphs with near unanimity polymorphisms pdf
Discrete Mathematics 12, no. 15, 2316–2328 (2012)  doi


[27] Kincses, J; Makay, G; Maróti, M; Osztényi, J; Zádori, L; A Special case of the Stahl conjecture pdf

European Journal of Combinatorics 34, no. 2,  502–511 (2013) doi


[28] Gyenizse, G; Maróti, M; Zádori, L The structure of polynomial operations associated with smooth digraphs pdf

Submitted (2014)