We stand with Ukraine  

Michael J. O'Donnell

Affiliations:
  • University of Chicago, Department of Computer Science, IL, USA
  • Johns Hopkins University, Department of Electrical Engineering and Computer Science, Baltimore, MD, USA
  • Purdue University, Department of Computer Science, West Lafayette, IN, USA
  • Cornell University, Ithaca, NY, USA (PhD 1976)


According to our database1, Michael J. O'Donnell authored at least 31 papers between 1977 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
Problems Encountered When Implementing Agile Methods in a Very Small Company.
[BibTeX]
[DOI]
Michael J. O'Donnell
,
Ita Richardson
Proceedings of the Software Process Improvement, 15th European Conference, 2008

2005
Separate handles from names on the internet.
[BibTeX]
[DOI]
Michael J. O'Donnell
Commun. ACM, 2005

2003
A Proposal to Separate Handles from Names on the Internet
[BibTeX]
[DOI]
Michael J. O'Donnell
CoRR, 2003

Open Network Handles Implemented in DNS
[BibTeX]
[DOI]
Michael J. O'Donnell
CoRR, 2003

2001
Leveled Garbage Collection.
[BibTeX]
[DOI]
Guanshan Tong
,
Michael J. O'Donnell
J. Funct. Log. Program., 2001

Source-Filter Decomposition of Harmonic Sounds
[BibTeX]
[DOI]
Ilia Bisnovatyi
,
Michael J. O'Donnell
CoRR, 2001

2000
The Sound Manifesto
[BibTeX]
[DOI]
Michael J. O'Donnell
,
Ilia Bisnovatyi
CoRR, 2000

1999
The Sources of Certainty in Computation and Formal Systems
[BibTeX]
[DOI]
Michael J. O'Donnell
CoRR, 1999

1996
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.
[BibTeX]
[DOI]
James Lipton
,
Michael J. O'Donnell
Ann. Pure Appl. Log., 1996

1994
Intuitive Counterexamples for Constructive Fallacies.
[BibTeX]
[DOI]
James Lipton
,
Michael J. O'Donnell
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1991
Connecting Formal Semantics to Constructive Intuitions.
[BibTeX]
[DOI]
Stuart A. Kurtz
,
John C. Mitchell
,
Michael J. O'Donnell
Proceedings of the Constructivity in Computer Science, 1991

1990
Testing Confluence of Nonterminating Rewriting Systems.
[BibTeX]
[DOI]
Yiyun Chen
,
Michael J. O'Donnell
Proceedings of the Conditional and Typed Rewriting Systems, 1990

Infinite Terms and Infinite Rewritings.
[BibTeX]
[DOI]
Yiyun Chen
,
Michael J. O'Donnell
Proceedings of the Conditional and Typed Rewriting Systems, 1990

1987
How to Prove Representation-Independent Independence Results.
[BibTeX]
[DOI]
Stuart A. Kurtz
,
Michael J. O'Donnell
,
James S. Royer
Inf. Process. Lett., 1987

Term-Rewriting Implementation of Equational Logic Programming.
[BibTeX]
[DOI]
Michael J. O'Donnell
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986
Collections of Functions for Perfect Hashing.
[BibTeX]
[DOI]
Francine Berman
,
Mary Ellen Bock
,
Eric Dittert
,
Michael J. O'Donnell
,
Darrell Plank
SIAM J. Comput., 1986

Realisability Semantics for Error-Tolerant Logics.
[BibTeX]
John C. Mitchell
,
Michael J. O'Donnell
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

Exact Real Arithmetic: A Case Study in Higher Order Programming.
[BibTeX]
[DOI]
Hans-Juergen Boehm
,
Robert Cartwright
,
Mark Riggle
,
Michael J. O'Donnell
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

1985
Lower Bounds for Sorting with Realistic Instruction Sets.
[BibTeX]
[DOI]
Eric Dittert
,
Michael J. O'Donnell
IEEE Trans. Computers, 1985

Implementation of an Interpreter for Abstract Equations.
[BibTeX]
[DOI]
Christoph M. Hoffmann
,
Michael J. O'Donnell
,
Robert Strandh
Softw. Pract. Exp., 1985

Equational Logic as a Programming Language.
[BibTeX]
[DOI]
Michael J. O'Donnell
Proceedings of the Logics of Programs, 1985

1984
Implementation of an Interpreter for Abstract Equations.
[BibTeX]
[DOI]
Christoph M. Hoffmann
,
Michael J. O'Donnell
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983
The Expressiveness of Simple and Second-Order Type Structures
[BibTeX]
[DOI]
Steven Fortune
,
Daniel Leivant
,
Michael J. O'Donnell
J. ACM, January, 1983

1982
Programming with Equations.
[BibTeX]
[DOI]
Christoph M. Hoffmann
,
Michael J. O'Donnell
ACM Trans. Program. Lang. Syst., 1982

A Combinatorial Problem Concerning Processor Interconnection Networks.
[BibTeX]
[DOI]
Michael J. O'Donnell
,
Carl H. Smith
IEEE Trans. Computers, 1982

Geometric Problems with Application to Hashing.
[BibTeX]
[DOI]
Douglas Comer
,
Michael J. O'Donnell
SIAM J. Comput., 1982

Pattern Matching in Trees.
[BibTeX]
[DOI]
Christoph M. Hoffmann
,
Michael J. O'Donnell
J. ACM, 1982

A Critique of the Foundations of Hoare Style Programming Logics.
[BibTeX]
[DOI]
Michael J. O'Donnell
Commun. ACM, 1982

1979
A Programming Language Theorem Which Is Independent of Peano Arithmetic
[BibTeX]
[DOI]
Michael J. O'Donnell
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Interpreter Generation Using Tree Pattern Matching.
[BibTeX]
[DOI]
Christoph M. Hoffmann
,
Michael J. O'Donnell
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1977
Computing in Systems Described by Equations
[BibTeX]
[DOI]
Michael J. O'Donnell
Lecture Notes in Computer Science 58, Springer, ISBN: 3-540-08531-9, 1977


  Loading...