| 1999 | COCOON | On the Average Sensitivity of Testing Square-Free Numbers. | Anna Bernasconi, Carsten Damm, Igor E. Shparlinski |
| 1999 | COCOON | On Covering and Rank Problems for Boolean Matrices and Their Applications. | Carsten Damm, Ki Hang Kim, Fred W. Roush |
| 1998 | MFCS | On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. | Carsten Damm |
| 1997 | GI | 33. Workshop "Komplexittstheorie, Datenstrukturen und Effiziente Algorithmen". | Christoph Meinel, Carsten Damm, Martin Mundhenk |
| 1996 | STACS | Some Bounds on Multiparty Communication Complexity of Pointer Jumping. | Carsten Damm, Stasys Jukna, Jir Sgall |
| 1995 | MFCS | Automata That Take Advice. | Carsten Damm, Markus Holzer |
| 1994 | MFCS | Inductive Counting Below LOGSPACE. | Carsten Damm, Markus Holzer |
| 1993 | DLT | Deterministic OL Languages are of Very Low Complexity: DOL is in AC | Carsten Damm, Markus Holzer, Klaus-Jrn Lange, Peter Rossmanith |
| 1992 | MFCS | Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. | Carsten Damm, Markus Holzer, Klaus-Jrn Lange |
| 1992 | STACS | Separating Counting Communication Complexity Classes. | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
| 1991 | STACS | Structure and Importance of Logspace-MOD-Classes. | Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel |
| 1990 | MFCS | The Complexity of Symmetric Functions in Parity Normal Forms. | Carsten Damm |
| 1989 | FCT | Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. | Carsten Damm, Christoph Meinel |