default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan E. Schmidt
Person information
Other persons with a similar name
- Stefan Hillmann
![[0000-0002-0795-9834]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0795-9834")
(aka: Stefan Schmidt 0002) — German Research Center for Artificial Intelligence (DFKI), Berlin, Germany - Sebastian S. Schmidt (aka: Sebastian Stefan Schmidt) — University Of Helsinki, Finland
- Stefan Schmidt — disambiguation page
- Stefan Andreas Schmidt
- Stefan Schmidt-Dichte
- Stefan Schmidt 0001 — University of Heidelberg, Heidelberg Collaboratory for Image Processing, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c21]Jens Kötters, Peter W. Eklund, Stefan E. Schmidt:
Conceptual Scaling of RDFS Ontologies. JOWO 2023- 2022
- [j9]Christian Jäkel, Stefan E. Schmidt:
Optimization problems on posets with regard to formal concept analysis. Int. J. Approx. Reason. 142: 196-205 (2022) - [c20]Jens Kötters, Stefan E. Schmidt:
Orbital Concept Lattices. ICCS 2022: 66-81 - 2021
- [c19]Christian Jäkel, Stefan E. Schmidt:
Packing Problems, Dimensions and the Tensor Product of Complete Lattices. ICCS 2021: 142-151 - 2020
- [c18]Tilo Krause, Lars Lumpe, Stefan E. Schmidt:
A Link between Pattern Structures and Random Forests. CLA 2020: 131-143 - [c17]Christian Jäkel, Stefan E. Schmidt:
Optimization Problems on Posets. CLA 2020: 185-196 - [c16]Lars Lumpe, Stefan E. Schmidt:
Patterns via Clustering as a Data Mining Tool. FCA4AI@ECAI 2020: 81-90
2010 – 2019
- 2018
- [c15]Christian Jäkel, Stefan E. Schmidt:
Cover Problems, Dimensions And The Tensor Product Of Complete Lattices. CLA 2018: 81-92 - [c14]Christian Jäkel, Stefan E. Schmidt:
Rectangle and Square Coverings of Tolerance Spaces and Their Direct Product. FCA4AI@IJCAI 2018: 57-68 - [c13]Tobias Gäbel-Hökenschnieder, Thorsten Pfeiffer, Stefan E. Schmidt:
Generalized Metrics with Applications to Ratings and Formal Concept Analysis. FCA4AI@IJCAI 2018: 81-92 - 2017
- [c12]Christian Jäkel, Stefan E. Schmidt:
Blocks of the Direct Product of Tolerance Relations. ISMIS 2017: 587-596 - [c11]Lars Lumpe, Stefan E. Schmidt:
Viewing Morphisms Between Pattern Structures via Their Concept Lattices and via Their Representations. ISMIS 2017: 597-608 - 2016
- [c10]Tobias Gäbel-Hökenschnieder, Thorsten Pfeiffer, Mosadak Al Salamat, Stefan E. Schmidt:
Generalized Metrics and Their Relevance for FCA and Closure Operators. CLA 2016: 175-187 - [c9]Tim B. Kaiser, Lars Lumpe, Stefan E. Schmidt:
A Fresh View on Fuzzy Formal Concept Analysis and Mathematical Morphology. CLA 2016: 255-272 - [c8]Lars Lumpe, Stefan E. Schmidt:
Morphisms Between Pattern Structures and Their Impact on Concept Lattices. FCA4AI@ECAI 2016: 25-34 - 2015
- [c7]Lars Lumpe, Stefan E. Schmidt:
Pattern Structures and Their Morphisms. CLA 2015: 171-179 - [c6]Lars Lumpe, Stefan E. Schmidt:
A Note on Pattern Structures and Their Projections. ICFCA 2015: 145-150 - 2012
- [c5]Tim B. Kaiser, Stefan E. Schmidt:
A Macroscopic Approach to FCA and Its Various Fuzzifications. ICFCA 2012: 140-147 - 2011
- [j8]Léonard Kwuida, Stefan E. Schmidt:
Valuations and closure operators on finite lattices. Discret. Appl. Math. 159(10): 990-1001 (2011) - [c4]Tim B. Kaiser, Stefan E. Schmidt:
Some Remarks on the Relation between Annotated Ordered Sets and Pattern Structures. PReMI 2011: 43-48 - 2010
- [j7]Tobias Schlemmer, Stefan E. Schmidt:
A formal concept analysis of harmonic forms and interval structures. Ann. Math. Artif. Intell. 59(2): 241-256 (2010) - [i1]Andreas Kendziorra, Stefan E. Schmidt:
Network coding with modular lattices. CoRR abs/1009.0682 (2010)
2000 – 2009
- 2008
- [j6]Tim B. Kaiser, Stefan E. Schmidt, Cliff A. Joslyn:
Adjusting Annotated Taxonomies. Int. J. Found. Comput. Sci. 19(2): 345-358 (2008) - 2006
- [c3]Tim B. Kaiser, Stefan E. Schmidt, Cliff A. Joslyn:
Concept Lattice Representations of Annotated Taxonomies. CLA 2006: 214-225 - 2004
- [c2]Tim B. Kaiser, Stefan E. Schmidt:
Geometry of Data Tables. ICFCA 2004: 222-235 - 2001
- [j5]Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt:
A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code. IEEE Trans. Inf. Theory 47(4): 1596-1598 (2001) - 2000
- [j4]Marcus Greferath, Stefan E. Schmidt:
Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem. J. Comb. Theory A 92(1): 17-28 (2000) - [j3]Iwan M. Duursma, Marcus Greferath, Stefan E. Schmidt:
On the Optimal Integer 4 Codes of Type II and Length 16. J. Comb. Theory A 92(1): 77-82 (2000) - [j2]Jonathan David Farley, Stefan E. Schmidt:
Posets That Locally Resemble Distributive Lattices: An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries). J. Comb. Theory A 92(2): 119-137 (2000)
1990 – 1999
- 1999
- [j1]Marcus Greferath, Stefan E. Schmidt:
Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code. IEEE Trans. Inf. Theory 45(7): 2522-2524 (1999) - [c1]Marcus Greferath, Stefan E. Schmidt:
Linear Codes and Rings of Matrices. AAECC 1999: 160-169 - 1995
- [b1]Stefan E. Schmidt:
Grundlegungen zu einer allgemeinen affinen Geometrie. Birkhäuser 1995, ISBN 978-3-7643-5171-7, pp. 1-118
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-09 13: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:
