The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Damm: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carsten Damm, Markus Holzer, Pierre McKenzie
    The Complexity of Tensor Calculus. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:70-86 [Conf]
  2. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    On the Average Sensitivity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:291-299 [Conf]
  3. Carsten Damm, Ki Hang Kim, Fred W. Roush
    On Covering and Rank Problems for Boolean Matrices and Their Applications. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:123-133 [Conf]
  4. Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
    Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:305-313 [Conf]
  5. Jochen Bern, Carsten Damm, Christoph Meinel
    The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. [Citation Graph (0, 0)][DBLP]
    ECDL, 1997, pp:405-421 [Conf]
  6. Carsten Damm, Christoph Meinel
    Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:127-136 [Conf]
  7. Christoph Meinel, Carsten Damm, Martin Mundhenk
    33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1997, pp:624-625 [Conf]
  8. Carsten Damm
    Problems Complete for +L. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:130-137 [Conf]
  9. Carsten Damm
    The Complexity of Symmetric Functions in Parity Normal Forms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:232-238 [Conf]
  10. Carsten Damm
    On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:780-788 [Conf]
  11. Carsten Damm, Markus Holzer
    Inductive Counting Below LOGSPACE. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:276-285 [Conf]
  12. Carsten Damm, Markus Holzer
    Automata That Take Advice. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:149-158 [Conf]
  13. Carsten Damm, Markus Holzer, Klaus-Jörn Lange
    Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:227-235 [Conf]
  14. Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
    Structure and Importance of Logspace-MOD-Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:360-371 [Conf]
  15. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:643-654 [Conf]
  16. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Counting Communication Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:281-292 [Conf]
  17. Stephan 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. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:142- [Journal]
  18. Carsten Damm, Markus Holzer, Pierre McKenzie
    The complexity of tensor calculus. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:1-2, pp:54-89 [Journal]
  19. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:109-127 [Journal]
  20. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  21. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    The average sensitivity of square-freeness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:39-51 [Journal]
  22. Carsten Damm
    A Note on Spectral Lower Bound Arguments for Decision Trees. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:65, n:, pp:136-138 [Journal]
  23. Carsten Damm, Markus Holzer, Pierre McKenzie
    The Complexity of Tensor Calculus [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:36, pp:- [Journal]
  24. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:44, pp:- [Journal]
  25. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    Separating Oblivious Linear Length MODp-Branching Program Classes. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:2, pp:63-75 [Journal]
  26. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:113-124 [Journal]
  27. Carsten Damm, Markus Holzer
    Inductive Counting for Width-Restricted Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:1, pp:91-99 [Journal]
  28. Carsten Damm
    Problems Complete for \oplus L. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:5, pp:247-250 [Journal]
  29. Carsten Damm
    Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:4, pp:175-179 [Journal]
  30. Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
    On approximation by XOR-OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:1, pp:17-21 [Journal]
  31. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
    On relations between counting communication complexity classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:259-280 [Journal]
  32. Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
    Structure and Importance of Logspace-MOD Class. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:3, pp:223-237 [Journal]
  33. Carsten Damm, Markus Holzer, Peter Rossmanith
    Expressing Uniformity via Oracles. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:355-366 [Journal]
  34. Carsten Damm, Christoph Meinel
    Separating Complexity Classes Related to Omega-Decision Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:351-360 [Journal]

Search in 0.044secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002