( en | de | ru )

 

Disambiguation of "Damm, Carsten"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.

, , , and . Developments in Language Theory, page 305-313. World Scientific, Singapore, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carsten Damm

Carsten Damm

Carsten Damm

Winfried Damm

Marianne Damm

 

Other publications of authors with the same name

On Covering and Rank Problems for Boolean Matrices and Their Applications., , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 123-133. Springer, (1999)Some Bounds on Multiparty Communication Complexity of Pointer Jumping., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 643-654. Springer, (1996)The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use., , and . ECDL, volume 1324 of Lecture Notes in Computer Science, page 405-421. Springer, (1997)Problems Complete for +L.. IMYCS, volume 464 of Lecture Notes in Computer Science, page 130-137. Springer, (1990)Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees., and . FCT, volume 380 of Lecture Notes in Computer Science, page 127-136. Springer, (1989)On the Average Sensitivity of Testing Square-Free Numbers., , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 291-299. Springer, (1999)The Complexity of Symmetric Functions in Parity Normal Forms.. MFCS, volume 452 of Lecture Notes in Computer Science, page 232-238. Springer, (1990)On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols.. MFCS, volume 1450 of Lecture Notes in Computer Science, page 780-788. Springer, (1998)Circuit and Decision Tree Complexity of Some Number Theoretic Problems., , and . Inf. Comput., 168 (2): 113-124 (2001)