Carsten Damm

ORCID

Publication Activity (10 Years)

Years Active: 1989-2007
Publications (10 Years): 0

Humboldt University of Berlin, Unter den Linden, Germany (PHD)

Education History

Humboldt University of Berlin, Unter den Linden, Germany

PHD

Publications

Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
On approximation by XOR-OBDDs. Inf. Process. Lett. 102 (1) (2007)
Stephan Waack, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. BMC Bioinform. 7 (2006)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69 (2) (2004)
Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12 (1-2) (2003)
Carsten Damm, Markus Holzer, Pierre McKenzie
The complexity of tensor calculus. Comput. Complex. 11 (1-2) (2002)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168 (2) (2001)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
The average sensitivity of square-freeness. Comput. Complex. 9 (1) (2000)
Carsten Damm, Markus Holzer, Pierre McKenzie
The Complexity of Tensor Calculus Electron. Colloquium Comput. Complex. 7 (36) (2000)
Carsten Damm, Markus Holzer, Pierre McKenzie
The Complexity of Tensor Calculus. Computational Complexity Conference (2000)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
On the Average Sensitivity of Testing Square-Free Numbers. COCOON (1999)
Carsten Damm, Ki Hang Kim, Fred W. Roush
On Covering and Rank Problems for Boolean Matrices and Their Applications. COCOON (1999)
Carsten Damm
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. Inf. Process. Lett. 69 (4) (1999)
Carsten Damm
On the Complexity of Tensor Formulae Universität Trier, Mathematik/Informatik, Forschungsbericht (1999)
Carsten Damm
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. MFCS (1998)
Carsten Damm, Stasys Jukna, Jirí Sgall
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Comput. Complex. 7 (2) (1998)
Anna Bernasconi, Carsten Damm, Igor E. Shparlinski
Circuit and Decision Tree Complexity of Some Number Theoretic Problems Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Carsten Damm
On Alternating vs. Parity Communication Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Carsten Damm
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols Universität Trier, Mathematik/Informatik, Forschungsbericht (1998)
Carsten Damm
A Note on Spectral Lower Bound Arguments for Decision Trees. Bull. EATCS 65 (1998)
Jochen Bern, Carsten Damm, Christoph Meinel
The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. ECDL (1997)
Carsten Damm, Markus Holzer, Peter Rossmanith
Expressing Uniformity via Oracles. Theory Comput. Syst. 30 (4) (1997)
Christoph Meinel, Carsten Damm, Martin Mundhenk
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung (1997)
Carsten Damm
A Note on Spectral Lower Bound Arguments for Decision Trees Universität Trier, Mathematik/Informatik, Forschungsbericht (1997)
Carsten Damm, Markus Holzer
Inductive Counting for Width-Restricted Branching Programs. Inf. Comput. 130 (1) (1996)
Carsten Damm, Stasys Jukna, Jirí Sgall
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. STACS (1996)
Carsten Damm, Stasys Jukna, Jirí Sgall
Some Bounds on Multiparty Communication Complexity of Pointer Jumping Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Carsten Damm, Markus Holzer
Automata That Take Advice. MFCS (1995)
Carsten Damm, Stasys Jukna, Jirí Sgall
Some Bounds on Multiparty Communication Complexity of Pointer Jumping Electron. Colloquium Comput. Complex. 2 (44) (1995)
Carsten Damm, Markus Holzer, Peter Rossmanith
Expressing Uniformity via Oracles Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Carsten Damm, Stasys Jukna
On Multiparity Games for Pointer Jumping Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Carsten Damm, Markus Holzer
Inductive Counting below LOGSPACE Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
-Branching Program Classes. J. Inf. Process. Cybern. 30 (2) (1994)
Carsten Damm, Markus Holzer
Inductive Counting Below LOGSPACE. MFCS (1994)
Carsten Damm
How Much ExOR Improves on OR? Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
. Developments in Language Theory (1993)
Carsten Damm, Katja Lenz
[2] Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Carsten Damm, Markus Holzer, Klaus-Jörn Lange
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS (1992)
Carsten Damm, Christoph Meinel
Separating Complexity Classes Related to Omega-Decision Trees. Theor. Comput. Sci. 106 (2) (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes Universität Trier, Mathematik/Informatik, Forschungsbericht (1992)
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
Separating Counting Communication Complexity Classes. STACS (1992)
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
Structure and Importance of Logspace-MOD Class. Math. Syst. Theory 25 (3) (1992)
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
Structure and Importance of Logspace-MOD-Classes. STACS (1991)
Carsten Damm
Problems Complete for \oplus L. Inf. Process. Lett. 36 (5) (1990)
Carsten Damm
The Complexity of Symmetric Functions in Parity Normal Forms. MFCS (1990)
Carsten Damm
Problems Complete for +L. IMYCS (1990)
Carsten Damm, Christoph Meinel
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. FCT (1989)

Carsten Damm.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Carsten Damm