Carsten Damm

928 total citations
16 papers, 436 citations indexed

About

Carsten Damm is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Carsten Damm has authored 16 papers receiving a total of 436 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 3 papers in Electrical and Electronic Engineering. Recurrent topics in Carsten Damm's work include Complexity and Algorithms in Graphs (9 papers), semigroups and automata theory (5 papers) and Machine Learning and Algorithms (4 papers). Carsten Damm is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), semigroups and automata theory (5 papers) and Machine Learning and Algorithms (4 papers). Carsten Damm collaborates with scholars based in Germany, Australia and Italy. Carsten Damm's co-authors include Stephan Waack, Rainer Merkl, Oliver Keller, W. Florian Fricke, Peter Meinicke, Christoph Meinel, Ulrich Hertrampf, Igor E. Shparlinski, Anna Bernasconi and Markus Holzer and has published in prestigious journals such as BMC Bioinformatics, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Carsten Damm

12 papers receiving 413 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Carsten Damm Germany	7	211	105	86	74	55	16	436
Thomas Conway Australia	11	285 1.4×	74 0.7×	57 0.7×	222 3.0×	27 0.5×	16	599
Jie Tan United States	11	498 2.4×	31 0.3×	117 1.4×	93 1.3×	28 0.5×	23	742
Sebastian Spänig Germany	8	320 1.5×	24 0.2×	82 1.0×	34 0.5×	39 0.7×	11	510
Nikolas Papanikolaou Greece	10	379 1.8×	46 0.4×	97 1.1×	31 0.4×	29 0.5×	14	530
Christina Boucher United States	14	323 1.5×	33 0.3×	63 0.7×	156 2.1×	57 1.0×	64	617
Bahrad A. Sokhansanj United States	15	529 2.5×	26 0.2×	71 0.8×	36 0.5×	23 0.4×	40	722
Michelle M. Li United States	6	154 0.7×	37 0.4×	52 0.6×	80 1.1×	20 0.4×	12	360
Qi Dai China	23	1.2k 5.6×	114 1.1×	60 0.7×	91 1.2×	20 0.4×	98	1.4k
David A. Clifton United Kingdom	6	227 1.1×	38 0.4×	21 0.2×	22 0.3×	29 0.5×	13	389

Countries citing papers authored by Carsten Damm

Since Specialization

Citations

This map shows the geographic impact of Carsten Damm's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Carsten Damm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Carsten Damm more than expected).

Fields of papers citing papers by Carsten Damm

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Carsten Damm. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Carsten Damm. The network helps show where Carsten Damm may publish in the future.

Co-authorship network of co-authors of Carsten Damm

This figure shows the co-authorship network connecting the top 25 collaborators of Carsten Damm. A scholar is included among the top collaborators of Carsten Damm based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Carsten Damm. Carsten Damm is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

Waack, Stephan, Oliver Keller, Carsten Damm, et al.. (2006). Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. BMC Bioinformatics. 7(1). 142–142. 285 indexed citations

Damm, Carsten, et al.. (2006). On approximation by ⊕-OBDDs. Information Processing Letters. 102(1). 17–21.

Damm, Carsten, Matthias Krause, Christoph Meinel, & Stephan Waack. (2004). On relations between counting communication complexity classes. Journal of Computer and System Sciences. 69(2). 259–280. 10 indexed citations

Hille, Andrea, Olivier Pradier, Carsten Damm, et al.. (2003). Effect of keratinocyte growth factor on the proliferation, clonogenic capacity and colony size of human epithelial tumour cells in vitro. International Journal of Radiation Biology. 79(2). 119–128. 2 indexed citations

Allender, Eric, Anna Bernasconi, Carsten Damm, et al.. (2003). Complexity of some arithmetic problems for binary polynomials. Computational Complexity. 12(1-2). 23–47.

Hille, Andrea, Margret Rave‐Fränk, Olivier Pradier, et al.. (2003). Effect of keratinocyte growth factor on the proliferation, clonogenic capacity and colony size of human epithelial tumour cells in vitro. International Journal of Radiation Biology. 79(2). 119–128. 27 indexed citations

Bernasconi, Anna, Carsten Damm, & Igor E. Shparlinski. (2001). Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Information and Computation. 168(2). 113–124. 5 indexed citations

Bernasconi, Anna, Carsten Damm, & Igor E. Shparlinski. (2000). The average sensitivity of square-freeness. Computational Complexity. 9(1). 39–51. 11 indexed citations

Damm, Carsten. (1999). Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones. Information Processing Letters. 69(4). 175–179.

10.

Damm, Carsten, Markus Holzer, & Peter Rossmanith. (1997). Expressing uniformity via oracles. Theory of Computing Systems. 30(4). 355–366. 1 indexed citations

11.

Damm, Carsten & Markus Holzer. (1996). Inductive Counting for Width-Restricted Branching Programs. Information and Computation. 130(1). 91–99. 6 indexed citations

12.

Damm, Carsten, Stasys Jukna, & Jiřı́ Sgall. (1996). Some bounds on multiparty communication complexity of pointer jumping. Lecture notes in computer science. 7(2). 109–127.

13.

Damm, Carsten, Markus Holzer, Klaus-Jörn Lange, & Peter Rossmanith. (1993). Deterministic OL Languages are of Very Low Complexity: DOL is in AC 0 .. 305–313. 2 indexed citations

14.

Damm, Carsten, et al.. (1992). Structure and importance of logspace-MOD class. Theory of Computing Systems. 25(3). 223–237. 68 indexed citations

15.

Damm, Carsten & Christoph Meinel. (1992). Separating complexity classes related to Ω-decision trees. Theoretical Computer Science. 106(2). 351–360. 1 indexed citations

16.

Damm, Carsten. (1990). Problems complete for ⊕ L. Information Processing Letters. 36(5). 247–250. 18 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact