Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. O'Donnell
Person information
- affiliation: University of Chicago, Department of Computer Science, IL, USA
- affiliation: Johns Hopkins University, Department of Electrical Engineering and Computer Science, Baltimore, MD, USA
- affiliation: Purdue University, Department of Computer Science, West Lafayette, IN, USA
- affiliation (PhD 1976): Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c13]Michael J. O'Donnell, Ita Richardson:
Problems Encountered When Implementing Agile Methods in a Very Small Company. EuroSPI 2008: 13-24- 2005
- [j13]Michael J. O'Donnell:
Separate handles from names on the internet. Commun. ACM 48(12): 78-83 (2005) - 2003
- [i5]Michael J. O'Donnell:
Open Network Handles Implemented in DNS. CoRR cs.NI/0301011 (2003) - [i4]Michael J. O'Donnell:
A Proposal to Separate Handles from Names on the Internet. CoRR cs.NI/0302017 (2003) - 2001
- [j12]Guanshan Tong, Michael J. O'Donnell:
Leveled Garbage Collection. J. Funct. Log. Program. 2001(5) (2001) - [i3]Ilia Bisnovatyi, Michael J. O'Donnell:
Source-Filter Decomposition of Harmonic Sounds. CoRR cs.SD/0103005 (2001) - 2000
- [i2]Michael J. O'Donnell, Ilia Bisnovatyi:
The Sound Manifesto. CoRR cs.SD/0007014 (2000)
1990 – 1999
- 1999
- [i1]Michael J. O'Donnell:
The Sources of Certainty in Computation and Formal Systems. CoRR cs.OH/9911010 (1999) - 1996
- [j11]James Lipton, Michael J. O'Donnell:
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels. Ann. Pure Appl. Log. 81(1-3): 187-239 (1996) - 1994
- [c12]James Lipton, Michael J. O'Donnell:
Intuitive Counterexamples for Constructive Fallacies. MFCS 1994: 87-111 - 1992
- [e1]J. Paul Myers Jr., Michael J. O'Donnell:
Constructivity in Computer Science, Summer Symposium, San Antonio, Texas, USA, June 19-22, Proceedings. Lecture Notes in Computer Science 613, Springer 1992, ISBN 3-540-55631-1 [contents] - 1991
- [c11]Stuart A. Kurtz, John C. Mitchell, Michael J. O'Donnell:
Connecting Formal Semantics to Constructive Intuitions. Constructivity in Computer Science 1991: 1-21 - 1990
- [c10]Yiyun Chen, Michael J. O'Donnell:
Infinite Terms and Infinite Rewritings. CTRS 1990: 115-126 - [c9]Yiyun Chen, Michael J. O'Donnell:
Testing Confluence of Nonterminating Rewriting Systems. CTRS 1990: 127-136
1980 – 1989
- 1987
- [j10]Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer:
How to Prove Representation-Independent Independence Results. Inf. Process. Lett. 24(1): 5-10 (1987) - [c8]Michael J. O'Donnell:
Term-Rewriting Implementation of Equational Logic Programming. RTA 1987: 1-12 - 1986
- [j9]Francine Berman, Mary Ellen Bock, Eric Dittert, Michael J. O'Donnell, Darrell Plank:
Collections of Functions for Perfect Hashing. SIAM J. Comput. 15(2): 604-618 (1986) - [c7]Hans-Juergen Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell:
Exact Real Arithmetic: A Case Study in Higher Order Programming. LISP and Functional Programming 1986: 162-173 - [c6]John C. Mitchell, Michael J. O'Donnell:
Realisability Semantics for Error-Tolerant Logics. TARK 1986: 363-382 - 1985
- [j8]Christoph M. Hoffmann, Michael J. O'Donnell, Robert Strandh:
Implementation of an Interpreter for Abstract Equations. Softw. Pract. Exp. 15(12): 1185-1204 (1985) - [j7]Eric Dittert, Michael J. O'Donnell:
Lower Bounds for Sorting with Realistic Instruction Sets. IEEE Trans. Computers 34(4): 311-317 (1985) - [c5]Michael J. O'Donnell:
Equational Logic as a Programming Language. Logic of Programs 1985: 255 - 1984
- [c4]Christoph M. Hoffmann, Michael J. O'Donnell:
Implementation of an Interpreter for Abstract Equations. POPL 1984: 111-121 - 1983
- [j6]Steven Fortune, Daniel Leivant, Michael J. O'Donnell:
The Expressiveness of Simple and Second-Order Type Structures. J. ACM 30(1): 151-185 (1983) - 1982
- [j5]Michael J. O'Donnell:
A Critique of the Foundations of Hoare Style Programming Logics. Commun. ACM 25(12): 927-935 (1982) - [j4]Christoph M. Hoffmann, Michael J. O'Donnell:
Pattern Matching in Trees. J. ACM 29(1): 68-95 (1982) - [j3]Douglas Comer, Michael J. O'Donnell:
Geometric Problems with Application to Hashing. SIAM J. Comput. 11(2): 217-226 (1982) - [j2]Michael J. O'Donnell, Carl H. Smith:
A Combinatorial Problem Concerning Processor Interconnection Networks. IEEE Trans. Computers 31(2): 163-164 (1982) - [j1]Christoph M. Hoffmann, Michael J. O'Donnell:
Programming with Equations. ACM Trans. Program. Lang. Syst. 4(1): 83-112 (1982) - 1981
- [c3]Michael J. O'Donnell:
A Critique of the Foundations of Hoare-Style Programming Logics. Logic of Programs 1981: 349-374
1970 – 1979
- 1979
- [c2]Christoph M. Hoffmann, Michael J. O'Donnell:
Interpreter Generation Using Tree Pattern Matching. POPL 1979: 169-179 - [c1]Michael J. O'Donnell:
A Programming Language Theorem Which Is Independent of Peano Arithmetic. STOC 1979: 176-188 - 1977
- [b1]Michael J. O'Donnell:
Computing in Systems Described by Equations. Lecture Notes in Computer Science 58, Springer 1977, ISBN 3-540-08531-9
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 01:36 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:
