| 1983 | ||
|---|---|---|
| j8 | Derek C. Oppen, Yogen K. Dalal: The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment. ACM Trans. Inf. Syst. 1(3): 230-253 (1983) | |
| 1981 | ||
| j7 | ||
| 1980 | ||
| j6 | Greg Nelson, Derek C. Oppen: Fast Decision Procedures Based on Congruence Closure. J. ACM 27(2): 356-364 (1980) | |
| j5 | ||
| j4 | Derek C. Oppen: Complexity, Convexity and Combinations of Theories. Theor. Comput. Sci. 12: 291-302 (1980) | |
| j3 | ||
| 1979 | ||
| j2 | Greg Nelson, Derek C. Oppen: Simplification by Cooperating Decision Procedures. ACM Trans. Program. Lang. Syst. 1(2): 245-257 (1979) | |
| 1978 | ||
| j1 | Derek C. Oppen: A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic. J. Comput. Syst. Sci. 16(3): 323-332 (1978) | |
| c7 | Robert Cartwright, Derek C. Oppen: Unrestricted Procedure Calls in Hoare's Logic. POPL 1978: 131-140 | |
| c6 | Charles G. Nelson, Derek C. Oppen: A Simplifier Based on Efficient Decision Algorithms. POPL 1978: 141-150 | |
| c5 | ||
| 1977 | ||
| c4 | ||
| 1975 | ||
| c3 | ||
| c2 | Derek C. Oppen, Stephen A. Cook: Proving Assertions about Programs that Manipulate Data Structures. STOC 1975: 107-116 | |
| 1973 | ||
| c1 | ||
| 1 | Robert Cartwright | |
| 2 | Stephen A. Cook | |
| 3 | Yogen K. Dalal | |
| 4 | Charles G. Nelson | |
| 5 | Greg Nelson |
Data released under the ODC-BY 1.0 license — See also our legal information page