Carsten Damm

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