 | 2008 |
| 31 |  | Michael J. O'Donnell,
Ita Richardson:
Problems Encountered When Implementing Agile Methods in a Very Small Company.
EuroSPI 2008: 13-24 |
| 2005 |
| 30 |  | Michael J. O'Donnell:
Separate handles from names on the internet.
Commun. ACM 48(12): 78-83 (2005) |
| 2003 |
| 29 |  | Michael J. O'Donnell:
Open Network Handles Implemented in DNS
CoRR cs.NI/0301011: (2003) |
| 28 |  | Michael J. O'Donnell:
A Proposal to Separate Handles from Names on the Internet
CoRR cs.NI/0302017: (2003) |
| 2001 |
| 27 |  | Ilia Bisnovatyi,
Michael J. O'Donnell:
Source-Filter Decomposition of Harmonic Sounds
CoRR cs.SD/0103005: (2001) |
| 26 |  | Guanshan Tong,
Michael J. O'Donnell:
Leveled Garbage Collection.
Journal of Functional and Logic Programming 2001(5): (2001) |
| 2000 |
| 25 |  | Michael J. O'Donnell,
Ilia Bisnovatyi:
The Sound Manifesto
CoRR cs.SD/0007014: (2000) |
| 1999 |
| 24 |  | Michael J. O'Donnell:
The Sources of Certainty in Computation and Formal Systems
CoRR cs.OH/9911010: (1999) |
| 1996 |
| 23 |  | James Lipton,
Michael J. O'Donnell:
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.
Ann. Pure Appl. Logic 81(1-3): 187-239 (1996) |
| 1994 |
| 22 |  | James Lipton,
Michael J. O'Donnell:
Intuitive Counterexamples for Constructive Fallacies.
MFCS 1994: 87-111 |
| 1992 |
| 21 |  | J. Paul Myers Jr.,
Michael J. O'Donnell:
Constructivity in Computer Science, Summer Symposium, San Antonio, Texas, USA, June 19-22, Proceedings
Springer 1992 |
| 1991 |
| 20 |  | Stuart A. Kurtz,
John C. Mitchell,
Michael J. O'Donnell:
Connecting Formal Semantics to Constructive Intuitions.
Constructivity in Computer Science 1991: 1-21 |
| 1990 |
| 19 |  | Yiyun Chen,
Michael J. O'Donnell:
Infinite Terms and Infinite Rewritings.
CTRS 1990: 115-126 |
| 18 |  | Yiyun Chen,
Michael J. O'Donnell:
Testing Confluence of Nonterminating Rewriting Systems.
CTRS 1990: 127-136 |
| 1987 |
| 17 |  | Michael J. O'Donnell:
Term-Rewriting Implementation of Equational Logic Programming.
RTA 1987: 1-12 |
| 16 |  | 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) |
| 1986 |
| 15 |  | 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 |
| 14 |  | John C. Mitchell,
Michael J. O'Donnell:
Realisability Semantics for Error-Tolerant Logics.
TARK 1986: 363-382 |
| 13 |  | 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) |
| 1985 |
| 12 |  | Michael J. O'Donnell:
Equational Logic as a Programming Language.
Logic of Programs 1985: 255 |
| 11 |  | Eric Dittert,
Michael J. O'Donnell:
Lower Bounds for Sorting with Realistic Instruction Sets.
IEEE Trans. Computers 34(4): 311-317 (1985) |
| 10 |  | Christoph M. Hoffmann,
Michael J. O'Donnell,
Robert Strandh:
Implementation of an Interpreter for Abstract Equations.
Softw., Pract. Exper. 15(12): 1185-1204 (1985) |
| 1984 |
| 9 |  | Christoph M. Hoffmann,
Michael J. O'Donnell:
Implementation of an Interpreter for Abstract Equations.
POPL 1984: 111-121 |
| 1982 |
| 8 |  | Christoph M. Hoffmann,
Michael J. O'Donnell:
Programming with Equations.
ACM Trans. Program. Lang. Syst. 4(1): 83-112 (1982) |
| 7 |  | Michael J. O'Donnell:
A Critique of the Foundations of Hoare Style Programming Logics.
Commun. ACM 25(12): 927-935 (1982) |
| 6 |  | Michael J. O'Donnell,
Carl H. Smith:
A Combinatorial Problem Concerning Processor Interconnection Networks.
IEEE Trans. Computers 31(2): 163-164 (1982) |
| 5 |  | Christoph M. Hoffmann,
Michael J. O'Donnell:
Pattern Matching in Trees.
J. ACM 29(1): 68-95 (1982) |
| 4 |  | Douglas Comer,
Michael J. O'Donnell:
Geometric Problems with Application to Hashing.
SIAM J. Comput. 11(2): 217-226 (1982) |
| 1981 |
| 3 |  | Michael J. O'Donnell:
A Critique of the Foundations of Hoare-Style Programming Logics.
Logic of Programs 1981: 349-374 |
| 1979 |
| 2 |  | Christoph M. Hoffmann,
Michael J. O'Donnell:
Interpreter Generation Using Tree Pattern Matching.
POPL 1979: 169-179 |
| 1977 |
| 1 |  | Michael J. O'Donnell:
Computing in Systems Described by Equations
Springer 1977 |