Computing in Systems Described by Equations - Michael J. O'Donnell (Springer, 1977)

Interpreter Generation Using Tree Pattern Matching. - Christoph M. Hoffmann; Michael J. O'Donnell (POPL, 1979)

A Programming Language Theorem Which Is Independent of Peano Arithmetic - Michael J. O'Donnell (STOC, 1979)

A Critique of the Foundations of Hoare Style Programming Logics. - Michael J. O'Donnell (Commun. ACM, 1982)

Pattern Matching in Trees. - Christoph M. Hoffmann; Michael J. O'Donnell (J. ACM, 1982)

Geometric Problems with Application to Hashing. - Douglas Comer; Michael J. O'Donnell (SIAM J. Comput., 1982)

A Combinatorial Problem Concerning Processor Interconnection Networks. - Michael J. O'Donnell; Carl H. Smith (IEEE Trans. Computers, 1982)

Programming with Equations. - Christoph M. Hoffmann; Michael J. O'Donnell (ACM Trans. Program. Lang. Syst., 1982)

The Expressiveness of Simple and Second-Order Type Structures - Steven Fortune; Daniel Leivant; Michael J. O'Donnell (J. ACM, 1983)

Implementation of an Interpreter for Abstract Equations. - Christoph M. Hoffmann; Michael J. O'Donnell (POPL, 1984)

Equational Logic as a Programming Language. - Michael J. O'Donnell (Logic of Programs, 1985)

Implementation of an Interpreter for Abstract Equations. - Christoph M. Hoffmann; Michael J. O'Donnell; Robert Strandh (Softw. Pract. Exp., 1985)

Lower Bounds for Sorting with Realistic Instruction Sets. - Eric Dittert; Michael J. O'Donnell (IEEE Trans. Computers, 1985)

Exact Real Arithmetic: A Case Study in Higher Order Programming. - Hans-Juergen Boehm; Robert Cartwright; Mark Riggle; Michael J. O'Donnell (LISP and Functional Programming, 1986)

Realisability Semantics for Error-Tolerant Logics. - John C. Mitchell; Michael J. O'Donnell (TARK, 1986)

Collections of Functions for Perfect Hashing. - Francine Berman; Mary Ellen Bock; Eric Dittert; Michael J. O'Donnell; Darrell Plank (SIAM J. Comput., 1986)

Term-Rewriting Implementation of Equational Logic Programming. - Michael J. O'Donnell (RTA, 1987)

How to Prove Representation-Independent Independence Results. - Stuart A. Kurtz; Michael J. O'Donnell; James S. Royer (Inf. Process. Lett., 1987)

Infinite Terms and Infinite Rewritings. - Yiyun Chen; Michael J. O'Donnell (CTRS, 1990)

Testing Confluence of Nonterminating Rewriting Systems. - Yiyun Chen; Michael J. O'Donnell (CTRS, 1990)

Connecting Formal Semantics to Constructive Intuitions. - Stuart A. Kurtz; John C. Mitchell; Michael J. O'Donnell (Constructivity in Computer Science, 1991)

Intuitive Counterexamples for Constructive Fallacies. - James Lipton; Michael J. O'Donnell (MFCS, 1994)

Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels. - James Lipton; Michael J. O'Donnell (Ann. Pure Appl. Log., 1996)

The Sources of Certainty in Computation and Formal Systems - Michael J. O'Donnell (CoRR, 1999)

The Sound Manifesto - Michael J. O'Donnell; Ilia Bisnovatyi (CoRR, 2000)

Source-Filter Decomposition of Harmonic Sounds - Ilia Bisnovatyi; Michael J. O'Donnell (CoRR, 2001)

Leveled Garbage Collection. - Guanshan Tong; Michael J. O'Donnell (J. Funct. Log. Program., 2001)

Open Network Handles Implemented in DNS - Michael J. O'Donnell (CoRR, 2003)

A Proposal to Separate Handles from Names on the Internet - Michael J. O'Donnell (CoRR, 2003)

Separate handles from names on the internet. - Michael J. O'Donnell (Commun. ACM, 2005)

Problems Encountered When Implementing Agile Methods in a Very Small Company. - Michael J. O'Donnell; Ita Richardson (EuroSPI, 2008)