#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1981

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stephan Waack, Oliver Keller, +6 authors Rainer Merkl
- BMC Bioinformatics
- 2005

Horizontal gene transfer (HGT) is considered a strong evolutionary force shaping the content of microbial genomes in a substantial manner. It is the difference in speed enabling the rapid adaptationâ€¦ (More)

- Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
- Mathematical systems theory
- 1992

We refine the techniques of Beigelet al. [4] who investigated polynomial-time counting classes, in order to make them applicable to the case of logarithmic space. We define the complexity classes andâ€¦ (More)

- Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
- STACS
- 1991

We reene the techniques of Beigel, Gill, Hertrampf 4] who investigated polynomial time counting classes, in order to make them applicable to the case of logarithmic space. We deene the complexityâ€¦ (More)

- Carsten Damm, Stasys Jukna, JirÃ Sgall
- STACS
- 1996

- Carsten Damm, Markus Holzer
- MFCS
- 1995

Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied inâ€¦ (More)

- Carsten Damm
- IMYCS
- 1990

- Carsten Damm, Markus Holzer, Klaus-JÃ¶rn Lange
- MFCS
- 1992

We improve several upper bounds to the complexity of the membership problem for languages deened by iterated morphisms (D0L systems). The complexity bounds are expressed in terms of DLOGT IME-uniformâ€¦ (More)

- Carsten Damm, Markus Holzer, Pierre McKenzie
- computational complexity
- 2002

Tensor calculus over semirings is shown relevant to complexity theory in unexpected ways. First, evaluating well-formed tensor formulas with explicit tensor entries is shown complete forâ€¦ (More)

- Carsten Damm, Markus Holzer
- UniversitÃ¤t Trier, Mathematik/Informatikâ€¦
- 1994

We apply the inductive counting technique to nondetermin-istic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs tooâ€¦ (More)

- Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
- J. Comput. Syst. Sci.
- 2004

We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. Thisâ€¦ (More)