default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Meineche Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c7]Erik Meineche Schmidt, Mogens Nielsen, Sven Skyum:
To Dexter - A Tribute from Aarhus. Logic and Program Semantics 2012: 341
2000 – 2009
- 2002
- [e4]Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt:
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Lecture Notes in Computer Science 2547, Springer 2002, ISBN 3-540-00346-0 [contents] - [e3]Martti Penttonen, Erik Meineche Schmidt:
Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Lecture Notes in Computer Science 2368, Springer 2002, ISBN 3-540-43866-1 [contents]
1990 – 1999
- 1998
- [c6]Erik Meineche Schmidt:
BRICS and Quantum Information Processing. FSTTCS 1998: 170-173 - 1994
- [e2]Erik Meineche Schmidt, Sven Skyum:
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings. Lecture Notes in Computer Science 824, Springer 1994, ISBN 3-540-58218-5 [contents] - 1992
- [j5]Kim S. Larsen
, Michael I. Schwartzbach, Erik Meineche Schmidt:
A New Formalism for Relational Algebra. Inf. Process. Lett. 41(3): 163-168 (1992)
1980 – 1989
- 1989
- [c5]Erik Meineche Schmidt, Michael I. Schwartzbach:
An Imperative Type Hierarchy with Partial Products. MFCS 1989: 458-470 - 1985
- [c4]Kurt Jensen, Erik Meineche Schmidt:
Pascal semantics by a combination of denotational semantics and high-level Petri nets. Applications and Theory in Petri Nets 1985: 297-329 - 1982
- [c3]Kurt Mehlhorn, Erik Meineche Schmidt:
Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract). STOC 1982: 330-337 - [e1]Mogens Nielsen, Erik Meineche Schmidt:
Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings. Lecture Notes in Computer Science 140, Springer 1982, ISBN 3-540-11576-5 [contents] - 1980
- [j4]Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980) - [c2]Erik Meineche Schmidt:
Space-Restricted Attribute Grammars. ICALP 1980: 436-448
1970 – 1979
- 1978
- [j3]Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. II. J. Comput. Syst. Sci. 16(1): 67-99 (1978) - [c1]Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt:
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. ICALP 1978: 227-240 - 1977
- [j2]Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. I. J. Comput. Syst. Sci. 15(3): 328-353 (1977) - [j1]Erik Meineche Schmidt, Thomas G. Szymanski:
Succinctness of Descriptions of Unambiguous Context-Free Languages. SIAM J. Comput. 6(3): 547-553 (1977)
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-24 22:53 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:
