default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiana Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c4]Mariane Liebold, Michael Pluder, Nadine Schaarschmidt, Lisette Hofmann, Josefin Müller, Lydia Stark, Nicole Filz, Sohrab Hejazi, Diana Schmidt:
Self-directed and Collaborative Learning in an Advanced Training Context: Conception and Implementation of an Innovative Online Teacher Qualification Program. ICL (1) 2022: 123-134
2000 – 2009
- 2004
- [j11]Lael C. Gatewood, Martien Limburg, Reed M. Gardner, Reinhold Haux, Monique W. M. Jaspers, Diana Schmidt, Thomas Wetter:
International Master Classes in health informatics. Int. J. Medical Informatics 73(2): 111-116 (2004) - [j10]Franz Josef Leven, Petra Knaup
, Diana Schmidt, Thomas Wetter:
Medical informatics at Heidelberg/Heilbronn: status-evaluation-new challenges in a specialised curriculum for medical informatics after thirty years of evolution. Int. J. Medical Informatics 73(2): 117-125 (2004) - [c3]Monique W. M. Jaspers, Reed M. Gardner, Lael C. Gatewood, Reinhold Haux, Diana Schmidt, Thomas Wetter:
The International Partnership in Health Informatics Education. MedInfo 2004: 884-888 - 2002
- [j9]Reinhold Haux, Diana Schmidt:
Master of science program in health information management at Heidelberg/Heilbronn: a health care oriented approach to medical informatics. Int. J. Medical Informatics 65(1): 31-39 (2002) - 2001
- [c2]Martien Limburg, Reed M. Gardner, Lael Cranmer Gatewood, Diana Schmidt, Reinhold Haux:
IΦE Workshop Scientific Work of Graduate Students of Medical Informatics. MedInfo 2001: 1528
1990 – 1999
- 1994
- [b1]Diana Schmidt:
Erfolgreich programmieren mit Ada - unter Berücksichtigung des objektorientierten Standards. Springer 1994, ISBN 978-3-540-57689-1, pp. I-XIII, 1-434
1980 – 1989
- 1985
- [j8]Diana Schmidt:
The Recursion-Theoretic Structure of Complexity Classes. Theor. Comput. Sci. 38: 143-156 (1985) - 1983
- [j7]Diana Schmidt:
An alternative definition of NP. Bull. EATCS 21: 57-67 (1983) - [c1]Diana Schmidt:
On the complement of one complexity class in another. Logic and Machines 1983: 77-87 - 1981
- [j6]Diana Schmidt:
The relation between the height of a well-founded partial ordering and the order types of its chains and antichains. J. Comb. Theory B 31(2): 183-189 (1981)
1970 – 1979
- 1979
- [j5]Diana Schmidt:
A Partition Theorem for Ordinals. J. Comb. Theory A 27(3): 382-384 (1979) - 1978
- [j4]Diana Schmidt:
Associative Ordinal Functions, Well Partial Orderings and a Problem of Skolem. Math. Log. Q. 24(19-24): 297-302 (1978) - 1977
- [j3]Diana Schmidt:
Built-up systems of fundamental sequences and hierarchies of number-theoretic functions. Arch. Math. Log. 18(1): 47-53 (1977) - [j2]Diana Schmidt:
Postscript to "built-up systems of fundamental sequences and hierarchies of number-theoretic functions". Arch. Math. Log. 18(1): 145-146 (1977) - 1975
- [j1]Diana Schmidt:
Bounds for the Closure Ordinals of Replete Monotonic Increasing Functions. J. Symb. Log. 40(3): 305-316 (1975)
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-10 21:27 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:
