| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Carsten Damm |
An Introductory Course on Communication Complexity.  |
New Developments in Formal Languages and Applications  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack |
On approximation by XOR-OBDDs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 Bioinformatics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
On relations between counting communication complexity classes. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski |
Complexity of some arithmetic problems for binary polynomials. |
Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). ((no classification)) |
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The complexity of tensor calculus. |
Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
| 1 | Anna Bernasconi, Carsten Damm, Igor Shparlinski |
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The Complexity of Tensor Calculus |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Anna Bernasconi, Carsten Damm, Igor Shparlinski |
The average sensitivity of square-freeness. |
Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Pierre McKenzie |
The Complexity of Tensor Calculus. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
On the Complexity of Tensor Formulae |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1999 |
RDF |
|
| 1 | Carsten Damm |
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Bernasconi, Carsten Damm, Igor Shparlinski |
On the Average Sensitivity of Testing Square-Free Numbers. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Ki Hang Kim, Fred W. Roush |
On Covering and Rank Problems for Boolean Matrices and Their Applications. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
On Alternating vs. Parity Communication Complexity |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1998 |
RDF |
|
| 1 | Anna Bernasconi, Carsten Damm, Igor Shparlinski |
Circuit and Decision Tree Complexity of Some Number Theoretic Problems |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1998 |
RDF |
|
| 1 | Carsten Damm |
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1998 |
RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
A Note on Spectral Lower Bound Arguments for Decision Trees. |
Bulletin of the EATCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm |
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
A Note on Spectral Lower Bound Arguments for Decision Trees |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1997 |
RDF |
|
| 1 | Carsten Damm, Markus Holzer, Peter Rossmanith |
Expressing Uniformity via Oracles. |
Theory Comput. Syst. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Bern, Carsten Damm, Christoph Meinel |
The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. |
ECDL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Meinel, Carsten Damm, Martin Mundhenk |
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". |
GI Jahrestagung |
1997 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer |
Inductive Counting for Width-Restricted Branching Programs. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna |
On Multiparity Games for Pointer Jumping |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Carsten Damm, Markus Holzer, Peter Rossmanith |
Expressing Uniformity via Oracles |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer |
Automata That Take Advice. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer |
Inductive Counting below LOGSPACE |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1994 |
RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Oblivious Linear Length MODp-Branching Program Classes. |
Elektronische Informationsverarbeitung und Kybernetik |
1994 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer |
Inductive Counting Below LOGSPACE. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Katja Lenz |
Symmetric Functions in AC0[2] |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1993 |
RDF |
|
| 1 | Carsten Damm |
How Much ExOR Improves on OR? |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1993 |
RDF |
|
| 1 | Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith |
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. |
Developments in Language Theory |
1993 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1992 |
RDF |
|
| 1 | Carsten Damm, Christoph Meinel |
Separating Complexity Classes Related to Omega-Decision Trees. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel |
Structure and Importance of Logspace-MOD Class. |
Mathematical Systems Theory |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Klaus-Jörn Lange |
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
complexity of Boolean function, communication complexity and distributed computing, probabilism, lower bound arguments, separation of complexity classes |
| 1 | Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel |
Structure and Importance of Logspace-MOD-Classes. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
Problems Complete for \oplus L. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
The Complexity of Symmetric Functions in Parity Normal Forms. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm |
Problems Complete for +L. |
IMYCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Christoph Meinel |
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. |
FCT |
1989 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")