Prof. Dr. Carsten Damm

Name Card

Main Affiliation
 
Staff Status
unigoe
 

1-8 of 8
 
The bibliographical data in your publication list are complete
You can correct existing data in the blue highlighted fields.To do this, please click on the coloured field. It is not possible to delete data here.
Fields that are not marked in colour (e. g. the authors) can be edited using the input form. To do so, click on the in front of the respective publication.
The bibliographic data in your publication list may be incomplete. You can
  • add any missing data in the fields marked in red or
  • correct existing data in the blue highlighted fields.
To do this, please click on the coloured field. It is not possible to delete data here.
Fields that are not marked in colour (e. g. the authors) can be edited using the input form. To do so, click on the in front of the respective publication.
Check/Uncheck all
  • 2007 | Journal Article
    ​ ​Brosenne, Henrik, Carsten Damm, Matthias Homeister, and Stephan Waack. "On approximation by circle plus-OBDDs​." ​Information Processing Letters ​102, no. 1 (2007): ​17​-21​. ​https://doi.org/10.1016/j.ipl.2006.10.011.
    ​Details  DOI  WoS 
  • 2006 | Journal Article | 
    ​ ​Waack, Stephan, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, and Rainer Merkl. "Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models​." ​BMC Bioinformatics ​7 (2006): ​142​. ​https://doi.org/10.1186/1471-2105-7-142.
    ​Details  DOI  PMID  PMC  WoS 
  • 2004 | Journal Article
    ​ ​Damm, Carsten, M. Krause, C. Meinel, and S. Waack. "On relations between counting communication complexity classes​." ​Journal of Computer and System Sciences ​69, no. 2 (2004): ​259​-280​. ​https://doi.org/10.1016/j.jcss.2004.03.002.
    ​Details  DOI  WoS 
  • 2003 | Journal Article
    ​ ​Allender, E., A. Bernasconi, C. Damm, J. von zur Gathen, M. Saks, and I. Shparlinski. "Complexity of some arithmetic problems for binary polynomials​." ​Computational Complexity ​12, no. 1-2 (2003): ​23​-47​. ​https://doi.org/10.1007/s00037-003-0176-9.
    ​Details  DOI  WoS 
  • 2002 | Conference Paper
    ​ ​Damm, C., M. Holzer, and P. McKenzie. "Complexity of tensor calculus​." ​Computational Complexity ​11​, ​no. 1-2 (2002): ​54​-89. https://doi.org/10.1007/s00037-000-0170-4.
    ​Details  DOI  WoS 
  • 2001 | Journal Article
    ​ ​Bernasconi, A., C. Damm, and I. Shparlinski. "Circuit and decision tree complexity of some number theoretic problems​." ​Information and Computation ​168, no. 2 (2001): ​113​-124​. ​https://doi.org/10.1006/inco.2000.3017.
    ​Details  DOI  WoS 
  • 2000 | Journal Article
    ​ ​Bernasconi, A., C. Damm, and I. Shparlinski. "The average sensitivity of square-freeness​." ​Computational Complexity ​9, no. 1 (2000): ​39​-51​. ​https://doi.org/10.1007/PL00001600.
    ​Details  DOI  WoS 
  • 1992 | Journal Article
    ​ ​Buntrock, Gerhard, Carsten Damm, Ulrich Hertrampf, and Christoph Meinel. "Structure and importance of logspace-MOD class​." ​Mathematical Systems Theory ​25, no. 3 (1992): ​223​-237​. ​https://doi.org/10.1007/BF01374526.
    ​Details  DOI 

Publication List

All Articles (Book & Journal) Conference objects Articles & Preprints Papers (Journal & Conference)

Type

Date issued

Author

Peer-Reviewed

Language

Fulltext

Options

Citation Style

GRO View APA Chicago MLA Vancouver
https://publications.goettingen-research-online.de URI: /cris/rp/rp48802
ID: 0000000
PREF: chicago TOKEN:

0

Sort

Issue Date
ASC DESC
Title
ASC DESC

Embed

JavaScript
Link

Export

Activate Export Mode
Deactivate Export Mode

Select some or all items (max. 800 for CSV/Excel) from the publications list, then choose an export format below.