default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁgnes Szendrei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Keith A. Kearnes
, Emil W. Kiss, Ágnes Szendrei:
Minimal abelian varieties of algebras, I. Int. J. Algebra Comput. 31(2): 205-217 (2021)
2010 – 2019
- 2019
- [j14]Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [i1]Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. CoRR abs/1803.08019 (2018) - 2015
- [j13]Keith A. Kearnes, Emil W. Kiss, Ágnes Szendrei:
Growth rates of algebras, II: Wiegold dichotomy. Int. J. Algebra Comput. 25(4): 555-566 (2015) - 2012
- [j12]Keith A. Kearnes, Ágnes Szendrei:
Clones of Algebras with Parallelogram Terms. Int. J. Algebra Comput. 22(1) (2012) - [j11]John Harding, Bart Kastermans, Keith A. Kearnes, J. Donald Monk, Ágnes Szendrei:
The 3rd International Conference on Boolean Algebra, Lattice Theory, Universal Algebra, Set Theory and Set-theoretical Topology - BLAST 2010. Order 29(2): 229-230 (2012) - [j10]Mike Behrisch, Miguel Couceiro, Keith A. Kearnes, Erkko Lehtonen, Ágnes Szendrei:
Commuting Polynomial Operations of Distributive Lattices. Order 29(2): 245-269 (2012) - [c2]Ágnes Szendrei:
Rosenberg-Type Completeness Criteria for Subclones of Slupecki's Clone. ISMVL 2012: 349-354 - 2011
- [j9]Gábor Péter Nagy, Gyula Pap, Ágnes Szendrei:
Foreword. Period. Math. Hung. 63(2): 151 (2011)
2000 – 2009
- 2009
- [j8]Erkko Lehtonen, Ágnes Szendrei:
Equivalence of operations with respect to discriminator clones. Discret. Math. 309(4): 673-685 (2009) - 2008
- [j7]Keith A. Kearnes, Ágnes Szendrei:
Clones Closed under Conjugation I: Clones with Constants. Int. J. Algebra Comput. 18(1): 7-58 (2008) - 2001
- [j6]Hassan Ali Shah Ali, Keith A. Kearnes, Ágnes Szendrei, Zafar Ahmed, M. A. Prasad, et al.:
A Difference of Square Roots: 10806. Am. Math. Mon. 108(6): 570 (2001)
1990 – 1999
- 1998
- [j5]Keith A. Kearnes, Ágnes Szendrei:
The Relationship Between Two Commutators. Int. J. Algebra Comput. 8(4): 497-532 (1998) - 1997
- [j4]Keith A. Kearnes, Ágnes Szendrei:
Self-Rectangulating Varieties of Type 5. Int. J. Algebra Comput. 7(4): 511-540 (1997) - 1993
- [j3]Joel Berman, Emil W. Kiss, Péter Pröhle, Ágnes Szendrei:
The set of types of a finitely generated variety. Discret. Math. 112(1-3): 1-20 (1993) - 1992
- [c1]Ágnes Szendrei:
A Completeness Criterion for Semi-Affine Algebras. ISMVL 1992: 314-319
1980 – 1989
- 1981
- [j2]László Szabó, Ágnes Szendrei:
Slupecki-type Criteria for Quasilinear Functions Over a Finite Dimensional Vector Space. J. Inf. Process. Cybern. 17(11/12): 601-611 (1981)
1970 – 1979
- 1978
- [j1]Ágnes Szendrei:
On Closed Sets of Linear Operations over a Finite Set of Square-free Cardinality. J. Inf. Process. Cybern. 14(11): 547-559 (1978)
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 2024-06-12 22:02 CEST 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:
