| |
| 1997 | ||
|---|---|---|
| 5 | Daniel E. Cohen: String Rewriting and Homology of Monoids. Mathematical Structures in Computer Science 7(3): 207-240 (1997) | |
| 1993 | ||
| 4 | Friedrich Otto, Daniel E. Cohen, Klaus Madlener: Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. Math. Log. Q. 39: 143-157 (1993) | |
| 1987 | ||
| 3 | Daniel E. Cohen: Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables. Computation Theory and Logic 1987: 78-87 | |
| 1983 | ||
| 2 | Daniel E. Cohen: Modular machines, undecidability and incompleteness. Logic and Machines 1983: 237-247 | |
| 1980 | ||
| 1 | Daniel E. Cohen: Degree Problems for Modular Machines. J. Symb. Log. 45(3): 510-528 (1980) | |
| 1 | Klaus Madlener | [4] |
| 2 | Friedrich Otto | [4] |