default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Zádori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Bertalan Bodor
, Gergo Gyenizse, Miklós Maróti, László Zádori:
Taylor is prime. Int. J. Algebra Comput. 34(6): 857-879 (2024)- [j19]Gergo Gyenizse, Péter Hajnal, László Zádori:
Representations of Finite Groups by Posets of Small Height. Order 41(3): 593-611 (2024) - 2023
- [j18]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): 31-46 (2023) - 2022
- [j17]Ádám Kunos, Miklós Maróti, László Zádori:
Critical Relations of Crowns in Critical Times of Coronavirus Depression. Order 39(2): 229-241 (2022) - 2021
- [i1]Gergo Gyenizse, Miklós Maróti, László Zádori:
Congruence permutability is prime. CoRR abs/2107.08456 (2021) - 2020
- [j16]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): 1717-1737 (2020)
2010 – 2019
- 2019
- [j15]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): 333-353 (2019) - [j14]Ádám Kunos, Miklós Maróti, László Zádori:
On Finite Generability of Clones of Finite Posets. Order 36(3): 653-666 (2019) - [j13]Ádám Kunos, Miklós Maróti, László Zádori:
Correction to: On Finite Generability of Clones of Finite Posets. Order 36(3): 667 (2019) - 2013
- [j12]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): 502-511 (2013) - 2012
- [j11]Miklós Maróti, László Zádori:
Reflexive digraphs with near unanimity polymorphisms. Discret. Math. 312(15): 2316-2328 (2012) - 2010
- [j10]Jaroslav Nesetril, Mark H. Siggers, László Zádori:
A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. 31(1): 280-296 (2010)
2000 – 2009
- 2009
- [j9]Benoît Larose, Matthew Valeriote, László Zádori:
Omitting Types, Bounded Width and the Ability to Count. Int. J. Algebra Comput. 19(5): 647-668 (2009) - 2007
- [j8]László Zádori:
Solvability of Systems of Polynomial Equations over Finite Algebras. Int. J. Algebra Comput. 17(4): 821-835 (2007) - 2006
- [j7]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): 563-582 (2006) - 2005
- [j6]Benoît Larose, Cynthia Loten, László Zádori:
A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55(2): 177-191 (2005) - 2003
- [j5]Benoît Larose, László Zádori:
The Complexity of the Extendibility Problem for Finite Posets. SIAM J. Discret. Math. 17(1): 114-121 (2003) - 2001
- [j4]Csaba Szabó, László Zádori:
Idempotent Totally Symmetric Operations on Finite Posets. Order 18(1): 39-47 (2001)
1990 – 1999
- 1997
- [j3]Benoît Larose, László Zádori:
Algebraic properties and dismantlability of finite posets. Discret. Math. 163(1-3): 89-99 (1997) - [j2]László Zádori:
Relational Sets and Categorical Equivalence of Algebras. Int. J. Algebra Comput. 7(5): 561-576 (1997)
1980 – 1989
- 1989
- [j1]Ingo Wegener, László Zádori:
A Note on the Relations Between Critical and Sensitive Complexity. J. Inf. Process. Cybern. 25(8/9): 417-421 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
