Carsten Damm

According to our database1, Carsten Damm authored at least 46 papers between 1989 and 2008.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2008
An Introductory Course on Communication Complexity.
Proceedings of the New Developments in Formal Languages and Applications, 2008

2007
On approximation by XOR-OBDDs.
Inf. Process. Lett., 2007

2006
Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models.
BMC Bioinformatics, 2006

2004
On relations between counting communication complexity classes.
J. Comput. Syst. Sci., 2004

2003
Complexity of some arithmetic problems for binary polynomials.
Computational Complexity, 2003

2001
Circuit and Decision Tree Complexity of Some Number Theoretic Problems.
Inf. Comput., 2001

2000
The Complexity of Tensor Calculus
Electronic Colloquium on Computational Complexity (ECCC), 2000

The average sensitivity of square-freeness.
Computational Complexity, 2000

The Complexity of Tensor Calculus.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
On the Complexity of Tensor Formulae
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones.
Inf. Process. Lett., 1999

On Covering and Rank Problems for Boolean Matrices and Their Applications.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On the Average Sensitivity of Testing Square-Free Numbers.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

On Alternating vs. Parity Communication Complexity
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

A Note on Spectral Lower Bound Arguments for Decision Trees.
Bulletin of the EATCS, 1998

On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A Note on Spectral Lower Bound Arguments for Decision Trees
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Expressing Uniformity via Oracles.
Theory Comput. Syst., 1997

33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen".
Proceedings of the Informatik '97, 1997

The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use.
Proceedings of the Research and Advanced Technology for Digital Libraries. First European Conference, 1997

1996
Inductive Counting for Width-Restricted Branching Programs.
Inf. Comput., 1996

Some Bounds on Multiparty Communication Complexity of Pointer Jumping.
Proceedings of the STACS 96, 1996

1995
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

On Multiparity Games for Pointer Jumping
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Expressing Uniformity via Oracles
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Some Bounds on Multiparty Communication Complexity of Pointer Jumping
Electronic Colloquium on Computational Complexity (ECCC), 1995

Automata That Take Advice.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Inductive Counting below LOGSPACE
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Separating Oblivious Linear Length MODp-Branching Program Classes.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Inductive Counting Below LOGSPACE.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993
How Much ExOR Improves on OR?
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Symmetric Functions in AC0[2]
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.
Proceedings of the Developments in Language Theory, 1993

1992
Separating Counting Communication Complexity Classes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Separating Complexity Classes Related to Omega-Decision Trees.
Theor. Comput. Sci., 1992

Structure and Importance of Logspace-MOD Class.
Mathematical Systems Theory, 1992

Separating Counting Communication Complexity Classes.
Proceedings of the STACS 92, 1992

Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
Zählklassen für Berechnungen mit logarithmischer Speicherbeschränkung: ein Zugang über Verzweigungsprogramme.
PhD thesis, 1991

Structure and Importance of Logspace-MOD-Classes.
Proceedings of the STACS 91, 1991

1990
Problems Complete for \oplus L.
Inf. Process. Lett., 1990

The Complexity of Symmetric Functions in Parity Normal Forms.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Problems Complete for +L.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees.
Proceedings of the Fundamentals of Computation Theory, 1989


  Loading...