Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. - Carsten Damm; Christoph Meinel (FCT, 1989)

Problems Complete for +L. - Carsten Damm (IMYCS, 1990)

The Complexity of Symmetric Functions in Parity Normal Forms. - Carsten Damm (MFCS, 1990)

Problems Complete for oplus L. - Carsten Damm (Inf. Process. Lett., 1990)

Structure and Importance of Logspace-MOD-Classes. - Gerhard Buntrock; Carsten Damm; Ulrich Hertrampf; Christoph Meinel (STACS, 1991)

Zählklassen für Berechnungen mit logarithmischer Speicherbeschränkung: ein Zugang über Verzweigungsprogramme. - Carsten Damm (1991)

Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. - Carsten Damm; Markus Holzer 001; Klaus-Jörn Lange (MFCS, 1992)

Structure and Importance of Logspace-MOD Class. - Gerhard Buntrock; Carsten Damm; Ulrich Hertrampf; Christoph Meinel (Math. Syst. Theory, 1992)

Separating Complexity Classes Related to Omega-Decision Trees. - Carsten Damm; Christoph Meinel (Theor. Comput. Sci., 1992)

Separating Counting Communication Complexity Classes - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992)

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. - Carsten Damm; Markus Holzer 001; Klaus-Jörn Lange; Peter Rossmanith (Developments in Language Theory, 1993)

Symmetric Functions in AC0[2] - Carsten Damm; Katja Lenz (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993)

How Much ExOR Improves on OR? - Carsten Damm (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993)

Separating Oblivious Linear Length MODp-Branching Program Classes. - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (J. Inf. Process. Cybern., 1994)

Inductive Counting below LOGSPACE - Carsten Damm; Markus Holzer 001 (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994)

Automata That Take Advice. - Carsten Damm; Markus Holzer 001 (MFCS, 1995)

On Multiparity Games for Pointer Jumping - Carsten Damm; Stasys Jukna (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995)

Inductive Counting for Width-Restricted Branching Programs. - Carsten Damm; Markus Holzer 001 (Inf. Comput., 1996)

The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. - Jochen Bern; Carsten Damm; Christoph Meinel (ECDL, 1997)

33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". - Christoph Meinel; Carsten Damm; Martin Mundhenk (GI Jahrestagung, 1997)

Expressing Uniformity via Oracles. - Carsten Damm; Markus Holzer 001; Peter Rossmanith (Theory Comput. Syst., 1997)

Some Bounds on Multiparty Communication Complexity of Pointer Jumping. - Carsten Damm; Stasys Jukna; Jirí Sgall (Comput. Complex., 1998)

A Note on Spectral Lower Bound Arguments for Decision Trees. - Carsten Damm (Bull. EATCS, 1998)

On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols - Carsten Damm (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998)

On Alternating vs. Parity Communication Complexity - Carsten Damm (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998)

On the Average Sensitivity of Testing Square-Free Numbers. - Anna Bernasconi 001; Carsten Damm; Igor E. Shparlinski (COCOON, 1999)

On Covering and Rank Problems for Boolean Matrices and Their Applications. - Carsten Damm; Ki Hang Kim; Fred W. Roush (COCOON, 1999)

Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. - Carsten Damm (Inf. Process. Lett., 1999)

On the Complexity of Tensor Formulae - Carsten Damm (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999)

The average sensitivity of square-freeness. - Anna Bernasconi 001; Carsten Damm; Igor E. Shparlinski (Comput. Complex., 2000)

Circuit and Decision Tree Complexity of Some Number Theoretic Problems. - Anna Bernasconi 001; Carsten Damm; Igor E. Shparlinski (Inf. Comput., 2001)

The complexity of tensor calculus. - Carsten Damm; Markus Holzer 001; Pierre McKenzie (Comput. Complex., 2002)

Complexity of some arithmetic problems for binary polynomials. - Eric Allender; Anna Bernasconi 001; Carsten Damm; Joachim von zur Gathen; Michael E. Saks; Igor E. Shparlinski (Comput. Complex., 2003)

On relations between counting communication complexity classes. - Carsten Damm; Matthias Krause 001; Christoph Meinel; Stephan Waack (J. Comput. Syst. Sci., 2004)

Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. - Stephan Waack; Oliver Keller; Roman Asper; Thomas Brodag; Carsten Damm; Wolfgang Florian Fricke; Katharina Surovcik; Peter Meinicke; Rainer Merkl (BMC Bioinform., 2006)

On approximation by XOR-OBDDs. - Henrik Brosenne; Carsten Damm; Matthias Homeister; Stephan Waack (Inf. Process. Lett., 2007)

An Introductory Course on Communication Complexity. - Carsten Damm (New Developments in Formal Languages and Applications, 2008)