default search action
Marcel Erné
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j22]Marcel Erné:
Web spaces and worldwide web spaces: topological aspects of domain theory. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [j21]Marcel Erné:
Categories of Locally Hypercompact Spaces and Quasicontinuous Posets. Appl. Categorical Struct. 26(5): 823-854 (2018) - 2016
- [j20]Marcel Erné:
To the Memory of Horst Herrlich, Lover of Tops, Cats and Birds. Appl. Categorical Struct. 24(5): 437 (2016) - [j19]Marcel Erné:
Choice-Free Dualities for Domains. Appl. Categorical Struct. 24(5): 471-496 (2016) - [i1]Marcel Erné:
Core spaces, sector spaces and fan spaces: a topological approach to domain theory. CoRR abs/1607.04721 (2016) - 2015
- [j18]Marcel Erné, Vinayak Joshi
:
Ideals in atomic posets. Discret. Math. 338(6): 954-971 (2015)
2000 – 2009
- 2009
- [j17]Marcel Erné:
Finiteness conditions and distributive laws for Boolean algebras. Math. Log. Q. 55(6): 572-586 (2009) - 2007
- [j16]Marcel Erné, Mai Gehrke, Ales Pultr
Complete Congruences on Topologies and Down-set Lattices. Appl. Categorical Struct. 15(1-2): 163-184 (2007) - [j15]Marcel Erné:
Choiceless, Pointless, but not Useless: Dualities for Preframes. Appl. Categorical Struct. 15(5-6): 541-572 (2007) - 2004
- [j14]Marcel Erné:
Intervals in Lattices of alpha-Meet-Closed Subsets. Order 21(2): 137-153 (2004) - 2003
- [j13]Marcel Erné, Branimir Seselja, Andreja Tepavcevic
Posets Generated by Irreducible Elements. Order 20(1): 79-89 (2003) - 2002
- [j12]Marcel Erné, Jobst Heitzig, Jürgen Reinhold:
On the Number of Distributive Lattices. Electron. J. Comb. 9(1) (2002) - 2001
- [j11]Marcel Erné, Dongsheng Zhao:
Z-Join Spectra of Z-Supercompactly Generated Lattices. Appl. Categorical Struct. 9(1): 41-63 (2001) - [j10]Marcel Erné:
Ideal Completions and Compactifications. Appl. Categorical Struct. 9(3): 217-243 (2001) - [j9]Marcel Erné, Jürgen Reinhold:
Embedding Structures. Graphs Comb. 17(4): 637-645 (2001) - [j8]Marcel Erné:
Constructive Order Theory. Math. Log. Q. 47(2): 211-222 (2001) - 2000
- [j7]Marcel Erné:
Prime Ideal Theory for General Algebras. Appl. Categorical Struct. 8(1-2): 115-144 (2000)
1990 – 1999
- 1999
- [j6]Marcel Erné:
Z-Continuous Posets and Their Topological Manifestation. Appl. Categorical Struct. 7(1-2): 31-70 (1999) - 1998
- [j5]K. Deiters, Marcel Erné:
Negations and contrapositions of complete lattices. Discret. Math. 181(1-3): 91-111 (1998) - 1995
- [j4]Marcel Erné, Kurt Stege:
Combinatorial applications of ordinal sum decompositions. Ars Comb. 40 (1995) - 1992
- [j3]Marcel Erné:
The number of partially ordered sets with more points than incomparable pairs. Discret. Math. 105(1-3): 49-60 (1992)
1980 – 1989
- 1986
- [j2]Paul Erdös, Marcel Erné:
Clique numbers of graphs. Discret. Math. 59(3): 235-242 (1986) - 1981
- [j1]Marcel Erné:
On the cardinalities of finite topologies and the number of antichains in partially ordered sets. Discret. Math. 35(1-3): 119-133 (1981)
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-04-25 05:47 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: