default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarsten Damm
Person information
- affiliation: University of Göttingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[p1]Carsten Damm:
An Introductory Course on Communication Complexity. New Developments in Formal Languages and Applications 2008: 95-123- 2007
- [j16]Henrik Brosenne, Carsten Damm
, Matthias Homeister, Stephan Waack:
On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007) - 2006
- [j15]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: 142 (2006) - 2004
- [j14]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004) - 2003
- [j13]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): 23-47 (2003) - 2002
- [j12]Carsten Damm, Markus Holzer, Pierre McKenzie:
The complexity of tensor calculus. Comput. Complex. 11(1-2): 54-89 (2002) - 2001
- [j11]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001) - 2000
- [j10]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
The average sensitivity of square-freeness. Comput. Complex. 9(1): 39-51 (2000) - [c16]Carsten Damm, Markus Holzer, Pierre McKenzie:
The Complexity of Tensor Calculus. CCC 2000: 70-86 - [i14]Carsten Damm, Markus Holzer, Pierre McKenzie:
The Complexity of Tensor Calculus. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j9]Carsten Damm:
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. Inf. Process. Lett. 69(4): 175-179 (1999) - [c15]Carsten Damm, Ki Hang Kim, Fred W. Roush:
On Covering and Rank Problems for Boolean Matrices and Their Applications. COCOON 1999: 123-133 - [c14]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299 - [i13]Carsten Damm:
On the Complexity of Tensor Formulae. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-20 (1999) - 1998
- [j8]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Comput. Complex. 7(2): 109-127 (1998) - [j7]Carsten Damm:
A Note on Spectral Lower Bound Arguments for Decision Trees. Bull. EATCS 65: 136-138 (1998) - [c13]Carsten Damm:
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. MFCS 1998: 780-788 - [i12]Carsten Damm:
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-06 (1998) - [i11]Carsten Damm:
On Alternating vs. Parity Communication Complexity. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-20 (1998) - [i10]Anna Bernasconi, Carsten Damm, Igor E. Shparlinski:
Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21 (1998) - 1997
- [j6]Carsten Damm, Markus Holzer, Peter Rossmanith:
Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997) - [c12]Jochen Bern, Carsten Damm, Christoph Meinel:
The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. ECDL 1997: 405-421 - [c11]Christoph Meinel, Carsten Damm, Martin Mundhenk:
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625 - [i9]Carsten Damm:
A Note on Spectral Lower Bound Arguments for Decision Trees. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-21 (1997) - 1996
- [j5]Carsten Damm, Markus Holzer:
Inductive Counting for Width-Restricted Branching Programs. Inf. Comput. 130(1): 91-99 (1996) - [c10]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. STACS 1996: 643-654 - 1995
- [c9]Carsten Damm, Markus Holzer:
Automata That Take Advice. MFCS 1995: 149-158 - [i8]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Electron. Colloquium Comput. Complex. TR95 (1995) - [i7]Carsten Damm, Markus Holzer, Peter Rossmanith:
Expressing Uniformity via Oracles. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01 (1995) - [i6]Carsten Damm, Stasys Jukna:
On Multiparity Games for Pointer Jumping. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-09 (1995) - [i5]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-17 (1995) - 1994
- [j4]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Oblivious Linear Length MODp-Branching Program Classes. J. Inf. Process. Cybern. 30(2): 63-75 (1994) - [c8]Carsten Damm, Markus Holzer:
Inductive Counting Below LOGSPACE. MFCS 1994: 276-285 - [i4]Carsten Damm, Markus Holzer:
Inductive Counting below LOGSPACE. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-12 (1994) - 1993
- [c7]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: 305-313 - [i3]Carsten Damm, Katja Lenz:
Symmetric Functions in AC0[2]. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-05 (1993) - [i2]Carsten Damm:
How Much ExOR Improves on OR? Universität Trier, Mathematik/Informatik, Forschungsbericht 93-07 (1993) - 1992
- [j3]Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD Class. Math. Syst. Theory 25(3): 223-237 (1992) - [j2]Carsten Damm, Christoph Meinel:
Separating Complexity Classes Related to Omega-Decision Trees. Theor. Comput. Sci. 106(2): 351-360 (1992) - [c6]Carsten Damm, Markus Holzer, Klaus-Jörn Lange:
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235 - [c5]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. STACS 1992: 281-292 - [i1]Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
Separating Counting Communication Complexity Classes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01 (1992) - 1991
- [b1]Carsten Damm:
Zählklassen für Berechnungen mit logarithmischer Speicherbeschränkung: ein Zugang über Verzweigungsprogramme. Humboldt University of Berlin, Unter den Linden, Germany, 1991 - [c4]Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD-Classes. STACS 1991: 360-371 - 1990
- [j1]Carsten Damm:
Problems Complete for \oplus L. Inf. Process. Lett. 36(5): 247-250 (1990) - [c3]Carsten Damm:
Problems Complete for +L. IMYCS 1990: 130-137 - [c2]Carsten Damm:
The Complexity of Symmetric Functions in Parity Normal Forms. MFCS 1990: 232-238
1980 – 1989
- 1989
- [c1]Carsten Damm, Christoph Meinel:
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. FCT 1989: 127-136
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
