Carsten Damm - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2008

An Introductory Course on Communication ComplexityCarsten Damm. In Gemma Bel Enguix, Maria Dolores Jiménez-López, Carlos Martín-Vide, editors, New Developments in Formal Languages and Applications. Volume 113 of Studies in Computational Intelligence, pages 95-123, Springer, 2008. [doi]

2007

On approximation by XOR-OBDDsHenrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack. ipl, 102(1):17-21, 2007. [doi]

2006

Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov modelsStephan Waack, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl. bmcbi, 7:142, 2006. [doi]

2004

On relations between counting communication complexity classesCarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack. jcss, 69(2):259-280, 2004. [doi]

2003

Complexity of some arithmetic problems for binary polynomialsEric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski. cc, 12(1-2):23-47, 2003. [doi]

2002

The complexity of tensor calculusCarsten Damm, Markus Holzer, Pierre McKenzie. cc, 11(1-2):54-89, 2002. [doi]

2001

Circuit and Decision Tree Complexity of Some Number Theoretic ProblemsAnna Bernasconi, Carsten Damm, Igor Shparlinski. iandc, 168(2):113-124, 2001.

2000

The average sensitivity of square-freenessAnna Bernasconi, Carsten Damm, Igor Shparlinski. cc, 9(1):39-51, 2000. [doi]

The Complexity of Tensor CalculusCarsten Damm, Markus Holzer, Pierre McKenzie. eccc, 7(36), 2000. [doi]

The Complexity of Tensor CalculusCarsten Damm, Markus Holzer, Pierre McKenzie. cocoon 2000: 70-86 [doi]

1999

On the Average Sensitivity of Testing Square-Free NumbersAnna Bernasconi, Carsten Damm, Igor Shparlinski. cocoon 1999: 291-299 [doi]

On Covering and Rank Problems for Boolean Matrices and Their ApplicationsCarsten Damm, Ki Hang Kim, Fred W. Roush. cocoon 1999: 123-133 [doi]

Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic OnesCarsten Damm. ipl, 69(4):175-179, 1999. [doi]

1998

Some Bounds on Multiparty Communication Complexity of Pointer JumpingCarsten Damm, Stasys Jukna, Jiri Sgall. cc, 7(2):109-127, 1998.

On Boolean vs. Modular Arithmetic for Circuits and Communication ProtocolsCarsten Damm. mfcs 1998: 780-788 [doi]

A Note on Spectral Lower Bound Arguments for Decision TreesCarsten Damm. eatcs, 65:136-138, 1998.

1997

The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in UseJochen Bern, Carsten Damm, Christoph Meinel. ercimdl 1997: 405-421

Expressing Uniformity via OraclesCarsten Damm, Markus Holzer, Peter Rossmanith. mst, 30(4):355-366, 1997.

33. Workshop Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen Christoph Meinel, Carsten Damm, Martin Mundhenk. gi 1997: 624-625

1996

Some Bounds on Multiparty Communication Complexity of Pointer JumpingCarsten Damm, Stasys Jukna, Jiri Sgall. STACS 1996: 643-654

Inductive Counting for Width-Restricted Branching ProgramsCarsten Damm, Markus Holzer. iandc, 130(1):91-99, 1996.

1995

Some Bounds on Multiparty Communication Complexity of Pointer JumpingCarsten Damm, Stasys Jukna, Jiri Sgall. eccc, 2(44), 1995. [doi]

Automata That Take AdviceCarsten Damm, Markus Holzer. mfcs 1995: 149-158

1994

Inductive Counting Below LOGSPACECarsten Damm, Markus Holzer. mfcs 1994: 276-285

Separating Oblivious Linear Length MOD::p::-Branching Program ClassesCarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack. eik, 30(2):63-75, 1994.

1993

Deterministic OL Languages are of Very Low Complexity: DOL is in AC:::0:::Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith. dlt 1993: 305-313

1992

1991

Structure and Importance of Logspace-MOD-ClassesGerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel. STACS 1991: 360-371

Zählklassen für Berechnungen mit logarithmischer Speicherbeschränkung: ein Zugang über VerzweigungsprogrammeCarsten Damm. PhD thesis, Humboldt University of Berlin, Unter den Linden, Germany, 1991. [doi]

1990

The Complexity of Symmetric Functions in Parity Normal FormsCarsten Damm. mfcs 1990: 232-238

Problems Complete for +LCarsten Damm. imycs 1990: 130-137

Problems Complete for /oplus LCarsten Damm. ipl, 36(5):247-250, 1990.

1989

Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision TreesCarsten Damm, Christoph Meinel. fct 1989: 127-136

Sign in or sign up to see more results.

runs on WebDSL