Prof. Dr. Carsten Damm

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
    ​ ​On approximation by circle plus-OBDDs​
    Brosenne, H. ; Damm, C. ; Homeister, M. & Waack, S. ​ (2007) 
    Information Processing Letters102(1) pp. 17​-21​.​ DOI: https://doi.org/10.1016/j.ipl.2006.10.011 
    Details  DOI  WoS 
  • 2006 Journal Article | 
    ​ ​Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models​
    Waack, S.; Keller, O.; Asper, R.; Brodag, T.; Damm, C. ; Fricke, W. F. & Surovcik, K. et al.​ (2006) 
    BMC Bioinformatics7 art. 142​.​ DOI: https://doi.org/10.1186/1471-2105-7-142 
    Details  DOI  PMID  PMC  WoS 
  • 2004 Journal Article
    ​ ​On relations between counting communication complexity classes​
    Damm, C. ; Krause, M.; Meinel, C. & Waack, S. ​ (2004) 
    Journal of Computer and System Sciences69(2) pp. 259​-280​.​ DOI: https://doi.org/10.1016/j.jcss.2004.03.002 
    Details  DOI  WoS 
  • 2003 Journal Article
    ​ ​Complexity of some arithmetic problems for binary polynomials​
    Allender, E.; Bernasconi, A.; Damm, C. ; von zur Gathen, J.; Saks, M. & Shparlinski, I.​ (2003) 
    Computational Complexity12(1-2) pp. 23​-47​.​ DOI: https://doi.org/10.1007/s00037-003-0176-9 
    Details  DOI  WoS 
  • 2002 Conference Paper
    ​ ​Complexity of tensor calculus​
    Damm, C. ; Holzer, M. & McKenzie, P.​ (2002)
    Computational Complexity11(1-2) pp. 54​-89. ​15th Annual IEEE Conference on Computational Complexity​, FLORENCE, ITALY.
    Basel​: Springer. DOI: https://doi.org/10.1007/s00037-000-0170-4 
    Details  DOI  WoS 
  • 2001 Journal Article
    ​ ​Circuit and decision tree complexity of some number theoretic problems​
    Bernasconi, A.; Damm, C.   & Shparlinski, I.​ (2001) 
    Information and Computation168(2) pp. 113​-124​.​ DOI: https://doi.org/10.1006/inco.2000.3017 
    Details  DOI  WoS 
  • 2000 Journal Article
    ​ ​The average sensitivity of square-freeness​
    Bernasconi, A.; Damm, C.   & Shparlinski, I.​ (2000) 
    Computational Complexity9(1) pp. 39​-51​.​ DOI: https://doi.org/10.1007/PL00001600 
    Details  DOI  WoS 
  • 1992 Journal Article
    ​ ​Structure and importance of logspace-MOD class​
    Buntrock, G.; Damm, C. ; Hertrampf, U. & Meinel, C.​ (1992) 
    Mathematical Systems Theory25(3) pp. 223​-237​.​ DOI: https://doi.org/10.1007/BF01374526 
    Details  DOI 

Publication List

Type

Date issued

Author

Peer-Reviewed

Language

Fulltext

Options

Citation Style

https://publications.goettingen-research-online.de URI: /cris/rp/rp48802
ID: 0000000
PREF: default TOKEN:

0

Sort

Issue Date
Title

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.