Carsten Damm

Proceedings of the New Developments in Formal Languages and Applications, 2008

2007

On approximation by XOR-OBDDs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

2006

Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models.

[BibT_eX]

[DOI]

Wolfgang Florian Fricke

Katharina Surovcik

Peter Meinicke

Rainer Merkl

BMC Bioinform., 2006

2004

On relations between counting communication complexity classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

2003

Complexity of some arithmetic problems for binary polynomials.

[BibT_eX]

[DOI]

Eric Allender

Joachim von zur Gathen

Michael E. Saks

Comput. Complex., 2003

2002

The complexity of tensor calculus.

[BibT_eX]

[DOI]

Pierre McKenzie

Comput. Complex., 2002

2001

Circuit and Decision Tree Complexity of Some Number Theoretic Problems.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

The average sensitivity of square-freeness.

[BibT_eX]

[DOI]

Comput. Complex., 2000

1999

On the Complexity of Tensor Formulae

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Covering and Rank Problems for Boolean Matrices and Their Applications.

[BibT_eX]

[DOI]

Ki Hang Kim

Fred W. Roush

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On the Average Sensitivity of Testing Square-Free Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On Alternating vs. Parity Communication Complexity

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

A Note on Spectral Lower Bound Arguments for Decision Trees.

[BibT_eX]

Bull. EATCS, 1998

Some Bounds on Multiparty Communication Complexity of Pointer Jumping.

[BibT_eX]

[DOI]

Stasys Jukna

Jirí Sgall

Comput. Complex., 1998

1997

Expressing Uniformity via Oracles.

[BibT_eX]

[DOI]

Peter Rossmanith

Theory Comput. Syst., 1997

33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen".

[BibT_eX]

[DOI]

Martin Mundhenk

Proceedings of the Informatik '97, 1997

The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use.

[BibT_eX]

[DOI]

Jochen Bern

Proceedings of the Research and Advanced Technology for Digital Libraries. First European Conference, 1997

1996

Inductive Counting for Width-Restricted Branching Programs.

[BibT_eX]

[DOI]

Inf. Comput., 1996

1995

On Multiparity Games for Pointer Jumping

[BibT_eX]

Stasys Jukna

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Automata That Take Advice.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Inductive Counting below LOGSPACE

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Separating Oblivious Linear Length MODp-Branching Program Classes.

[BibT_eX]

J. Inf. Process. Cybern., 1994

1993

How Much ExOR Improves on OR?

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Symmetric Functions in AC0[2]

[BibT_eX]

Katja Lenz

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

Separating Counting Communication Complexity Classes

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Separating Complexity Classes Related to Omega-Decision Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Structure and Importance of Logspace-MOD Class.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1992

Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

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

[BibT_eX]

[DOI]

PhD thesis, 1991

Structure and Importance of Logspace-MOD-Classes.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

1990

Problems Complete for \oplus L.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

The Complexity of Symmetric Functions in Parity Normal Forms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Problems Complete for +L.

[BibT_eX]

[DOI]

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees.

[BibT_eX]

[DOI]