dblp.uni-trier.dewww.uni-trier.de

Carsten Damm Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
46EEHenrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack: On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007)
2006
45EEStephan Waack, Oliver Keller, Roman Asper, Thomas Brodag, Carsten Damm, Wolfgang Florian Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl: Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. BMC Bioinformatics 7: 142 (2006)
2004
44EECarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004)
2003
43EEEric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski: Complexity of some arithmetic problems for binary polynomials. Computational Complexity 12(1-2): 23-47 (2003)
2002
42EECarsten Damm, Markus Holzer, Pierre McKenzie: The complexity of tensor calculus. Computational Complexity 11(1-2): 54-89 (2002)
2001
41 Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems. Inf. Comput. 168(2): 113-124 (2001)
2000
40EECarsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus. IEEE Conference on Computational Complexity 2000: 70-86
39EEAnna Bernasconi, Carsten Damm, Igor Shparlinski: The average sensitivity of square-freeness. Computational Complexity 9(1): 39-51 (2000)
38EECarsten Damm, Markus Holzer, Pierre McKenzie: The Complexity of Tensor Calculus Electronic Colloquium on Computational Complexity (ECCC) 7(36): (2000)
1999
37EECarsten Damm, Ki Hang Kim, Fred W. Roush: On Covering and Rank Problems for Boolean Matrices and Their Applications. COCOON 1999: 123-133
36EEAnna Bernasconi, Carsten Damm, Igor Shparlinski: On the Average Sensitivity of Testing Square-Free Numbers. COCOON 1999: 291-299
35EECarsten Damm: Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. Inf. Process. Lett. 69(4): 175-179 (1999)
34 Carsten Damm: On the Complexity of Tensor Formulae Universität Trier, Mathematik/Informatik, Forschungsbericht 99-20: (1999)
1998
33EECarsten Damm: On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. MFCS 1998: 780-788
32 Carsten Damm: A Note on Spectral Lower Bound Arguments for Decision Trees. Bulletin of the EATCS 65: 136-138 (1998)
31 Carsten Damm, Stasys Jukna, Jiri Sgall: Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Computational Complexity 7(2): 109-127 (1998)
30 Carsten Damm: On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols Universität Trier, Mathematik/Informatik, Forschungsbericht 98-06: (1998)
29 Carsten Damm: On Alternating vs. Parity Communication Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht 98-20: (1998)
28 Anna Bernasconi, Carsten Damm, Igor Shparlinski: Circuit and Decision Tree Complexity of Some Number Theoretic Problems Universität Trier, Mathematik/Informatik, Forschungsbericht 98-21: (1998)
1997
27EEJochen Bern, Carsten Damm, Christoph Meinel: The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. ECDL 1997: 405-421
26 Christoph Meinel, Carsten Damm, Martin Mundhenk: 33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625
25 Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997)
24 Carsten Damm: A Note on Spectral Lower Bound Arguments for Decision Trees Universität Trier, Mathematik/Informatik, Forschungsbericht 97-21: (1997)
1996
23EECarsten Damm, Stasys Jukna, Jiri Sgall: Some Bounds on Multiparty Communication Complexity of Pointer Jumping. STACS 1996: 643-654
22 Carsten Damm, Markus Holzer: Inductive Counting for Width-Restricted Branching Programs. Inf. Comput. 130(1): 91-99 (1996)
1995
21EECarsten Damm, Markus Holzer: Automata That Take Advice. MFCS 1995: 149-158
20EECarsten Damm, Stasys Jukna, Jiri Sgall: Some Bounds on Multiparty Communication Complexity of Pointer Jumping Electronic Colloquium on Computational Complexity (ECCC) 2(44): (1995)
19 Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01: (1995)
18 Carsten Damm, Stasys Jukna: On Multiparity Games for Pointer Jumping Universität Trier, Mathematik/Informatik, Forschungsbericht 95-09: (1995)
17 Carsten Damm, Stasys Jukna, Jiri Sgall: Some Bounds on Multiparty Communication Complexity of Pointer Jumping Universität Trier, Mathematik/Informatik, Forschungsbericht 95-17: (1995)
1994
16EECarsten Damm, Markus Holzer: Inductive Counting Below LOGSPACE. MFCS 1994: 276-285
15 Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Oblivious Linear Length MODp-Branching Program Classes. Elektronische Informationsverarbeitung und Kybernetik 30(2): 63-75 (1994)
14 Carsten Damm, Markus Holzer: Inductive Counting below LOGSPACE Universität Trier, Mathematik/Informatik, Forschungsbericht 94-12: (1994)
1993
13 Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith: Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. Developments in Language Theory 1993: 305-313
12 Carsten Damm, Katja Lenz: Symmetric Functions in AC0[2] Universität Trier, Mathematik/Informatik, Forschungsbericht 93-05: (1993)
11 Carsten Damm: How Much ExOR Improves on OR? Universität Trier, Mathematik/Informatik, Forschungsbericht 93-07: (1993)
1992
10EECarsten Damm, Markus Holzer, Klaus-Jörn Lange: Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235
9EECarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes. STACS 1992: 281-292
8 Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel: Structure and Importance of Logspace-MOD Class. Mathematical Systems Theory 25(3): 223-237 (1992)
7 Carsten Damm, Christoph Meinel: Separating Complexity Classes Related to Omega-Decision Trees. Theor. Comput. Sci. 106(2): 351-360 (1992)
6 Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack: Separating Counting Communication Complexity Classes Universität Trier, Mathematik/Informatik, Forschungsbericht 92-01: (1992)
1991
5EEGerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel: Structure and Importance of Logspace-MOD-Classes. STACS 1991: 360-371
1990
4EECarsten Damm: Problems Complete for +L. IMYCS 1990: 130-137
3EECarsten Damm: The Complexity of Symmetric Functions in Parity Normal Forms. MFCS 1990: 232-238
2 Carsten Damm: Problems Complete for \oplus L. Inf. Process. Lett. 36(5): 247-250 (1990)
1989
1 Carsten Damm, Christoph Meinel: Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. FCT 1989: 127-136

Coauthor Index

1Eric Allender [43]
2Roman Asper [45]
3Jochen Bern [27]
4Anna Bernasconi [28] [36] [39] [41] [43]
5Thomas Brodag [45]
6Henrik Brosenne [46]
7Gerhard Buntrock [5] [8]
8Wolfgang Florian Fricke [45]
9Joachim von zur Gathen [43]
10Ulrich Hertrampf [5] [8]
11Markus Holzer [10] [13] [14] [16] [19] [21] [22] [25] [38] [40] [42]
12Matthias Homeister [46]
13Stasys Jukna [17] [18] [20] [23] [31]
14Oliver Keller [45]
15Ki Hang Kim [37]
16Matthias Krause [6] [9] [15] [44]
17Klaus-Jörn Lange [10] [13]
18Katja Lenz [12]
19Pierre McKenzie [38] [40] [42]
20Christoph Meinel [1] [5] [6] [7] [8] [9] [15] [26] [27] [44]
21Peter Meinicke [45]
22Rainer Merkl [45]
23Martin Mundhenk [26]
24Peter Rossmanith [13] [19] [25]
25Fred W. Roush [37]
26Michael E. Saks [43]
27Jiri Sgall [17] [20] [23] [31]
28Igor Shparlinski [28] [36] [39] [41] [43]
29Katharina Surovcik [45]
30Stephan Waack [6] [9] [15] [44] [45] [46]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)