Michael J. O'Donnell

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2008
Problems Encountered When Implementing Agile Methods in a Very Small Company.
Proceedings of the Software Process Improvement, 15th European Conference, 2008

2005
Separate handles from names on the internet.
Commun. ACM, 2005

2001
Leveled Garbage Collection.
Journal of Functional and Logic Programming, 2001

1996
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.
Ann. Pure Appl. Logic, 1996

1994
Intuitive Counterexamples for Constructive Fallacies.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1991
Connecting Formal Semantics to Constructive Intuitions.
Proceedings of the Constructivity in Computer Science, 1991

1990
Testing Confluence of Nonterminating Rewriting Systems.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

Infinite Terms and Infinite Rewritings.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

1987
How to Prove Representation-Independent Independence Results.
Inf. Process. Lett., 1987

Term-Rewriting Implementation of Equational Logic Programming.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986
Collections of Functions for Perfect Hashing.
SIAM J. Comput., 1986

Realisability Semantics for Error-Tolerant Logics.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

Exact Real Arithmetic: A Case Study in Higher Order Programming.
LISP and Functional Programming, 1986

1985
Lower Bounds for Sorting with Realistic Instruction Sets.
IEEE Trans. Computers, 1985

Implementation of an Interpreter for Abstract Equations.
Softw., Pract. Exper., 1985

Equational Logic as a Programming Language.
Proceedings of the Logics of Programs, 1985

1984
Implementation of an Interpreter for Abstract Equations.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1982
Programming with Equations.
ACM Trans. Program. Lang. Syst., 1982

A Combinatorial Problem Concerning Processor Interconnection Networks.
IEEE Trans. Computers, 1982

Geometric Problems with Application to Hashing.
SIAM J. Comput., 1982

Pattern Matching in Trees.
J. ACM, 1982

1981
A Critique of the Foundations of Hoare-Style Programming Logics.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1979
Interpreter Generation Using Tree Pattern Matching.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1977
Computing in Systems Described by Equations
Lecture Notes in Computer Science 58, Springer, ISBN: 3-540-08531-9, 1977


  Loading...