damm's cdpublist [34 articles]

Recent papers added to damm's library classified by the tag cdpublist. You can also see everyone's cdpublist.

	On approximation by ⊕-OBDDs. [My Copy] In ReedMuller 2005 (2005) by Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack posted to cdpublist by damm on 2008-04-03 16:34:03 as
	SIGI-HMM: Score-Based Prediction of Genomic Islands in Prokaryotic Genomes [My Copy] (2006) by Oliver Keller, Katharina Surovcik, Thomas Brodag, et al.Rainer Merkl, Roman Asper, Carsten Damm, Stephan Waack posted to bio cdpublist information by damm on 2008-04-03 16:26:17 as
	An Introductory Course on Communication Complexity [My Copy] In New Developments in Formal Languages and Applications, Vol. 113 (April 2008), pp. 95-124. by Carsten Damm edited by Gemma Bel-Enguix, Dolores M. Jiménez-López, Carlos Martín-Vide posted to cdpublist by damm on 2008-03-31 16:00:04 as
	Separating Completely Complexity Classes Related to Polynomial Size $\Ω$-Decision Trees. [My Copy] In FCT (1989), pp. 127-136. by Carsten Damm, Christoph Meinel posted to cdpublist by damm on 2008-03-11 15:49:46 as
	The Complexity of Symmetric Functions in Parity Normal Forms. [My Copy] In MFCS (1990), pp. 232-238. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:46 as
	Problems Complete for +L. [My Copy] In IMYCS (1990), pp. 130-137. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:46 as
	Structure and Importance of Logspace-MOD-Classes. [My Copy] In STACS (1991), pp. 360-371. by Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Separating Counting Communication Complexity Classes. [My Copy] In STACS (1992), pp. 281-292. by Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. [My Copy] In MFCS (1992), pp. 227-235. by Carsten Damm, Markus Holzer, Klaus J. Lange posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Deterministic OL Languages are of Very Low Complexity: D0L is in AC$^\\mbox0$. [My Copy] In Developments in Language Theory (1993), pp. 305-313. by Carsten Damm, Markus Holzer, Klaus J. Lange, Peter Rossmanith posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Inductive Counting Below LOGSPACE. [My Copy] In MFCS (1994), pp. 276-285. by Carsten Damm, Markus Holzer posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Automata That Take Advice. [My Copy] In MFCS (1995), pp. 149-158. by Carsten Damm, Markus Holzer posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [My Copy] In STACS (1996), pp. 643-654. by Carsten Damm, Stasys Jukna, Jiri Sgall posted to cdpublist by damm on 2008-03-11 15:49:45 as
	The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use. [My Copy] In ECDL (1997), pp. 405-421. by Jochen Bern, Carsten Damm, Christoph Meinel posted to cdpublist by damm on 2008-03-11 15:49:45 as
	On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. [My Copy] In MFCS (1998), pp. 780-788. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:45 as
	On the Average Sensitivity of Testing Square-Free Numbers. [My Copy] In COCOON (1999), pp. 291-299. by Anna Bernasconi, Carsten Damm, Igor Shparlinski posted to cdpublist by damm on 2008-03-11 15:49:45 as
	On Covering and Rank Problems for Boolean Matrices and Their Applications. [My Copy] In COCOON (1999), pp. 123-133. by Carsten Damm, Ki H. Kim, Fred W. Roush posted to cdpublist by damm on 2008-03-11 15:49:45 as
	The Complexity of Tensor Calculus. [My Copy] In IEEE Conference on Computational Complexity (2000), pp. 70-86. by Carsten Damm, Markus Holzer, Pierre Mckenzie posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Problems Complete for $\⊕ L$. [My Copy] Inf. Process. Lett., Vol. 36, No. 5. (1990), pp. 247-250. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Separating Complexity Classes Related to $\Ω$-Decision Trees. [My Copy] Theor. Comput. Sci., Vol. 106, No. 2. (1992), pp. 351-360. by Carsten Damm, Christoph Meinel posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Structure and Importance of Logspace-MOD Class. [My Copy] Mathematical Systems Theory, Vol. 25, No. 3. (1992), pp. 223-237. by Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Separating Oblivious Linear Length MOD$_\\mboxp$-Branching Program Classes. [My Copy] Elektronische Informationsverarbeitung und Kybernetik, Vol. 30, No. 2. (1994), pp. 63-75. by Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Inductive Counting for Width-Restricted Branching Programs. [My Copy] Inf. Comput., Vol. 130, No. 1. (1996), pp. 91-99. by Carsten Damm, Markus Holzer posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Expressing Uniformity via Oracles. [My Copy] Theory Comput. Syst., Vol. 30, No. 4. (1997), pp. 355-366. by Carsten Damm, Markus Holzer, Peter Rossmanith posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [My Copy] Computational Complexity, Vol. 7, No. 2. (1998), pp. 109-127. by Carsten Damm, Stasys Jukna, Jiri Sgall posted to cdpublist by damm on 2008-03-11 15:49:45 as
	A Note on Spectral Lower Bound Arguments for Decision Trees. [My Copy] Bulletin of the EATCS, Vol. 65 (1998), pp. 136-138. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. [My Copy] Inf. Process. Lett., Vol. 69, No. 4. (1999), pp. 175-179. by Carsten Damm posted to cdpublist by damm on 2008-03-11 15:49:45 as
	The average sensitivity of square-freeness. [My Copy] Computational Complexity, Vol. 9, No. 1. (2000), pp. 39-51. by Anna Bernasconi, Carsten Damm, Igor Shparlinski posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [My Copy] Inf. Comput., Vol. 168, No. 2. (2001), pp. 113-124. by Anna Bernasconi, Carsten Damm, Igor Shparlinski posted to cdpublist by damm on 2008-03-11 15:49:45 as
	The complexity of tensor calculus. [My Copy] Computational Complexity, Vol. 11, No. 1-2. (2002), pp. 54-89. by Carsten Damm, Markus Holzer, Pierre Mckenzie posted to cdpublist by damm on 2008-03-11 15:49:45 as
	Complexity of some arithmetic problems for binary polynomials. [My Copy] Computational Complexity, Vol. 12, No. 1-2. (2003), pp. 23-47. by Eric Allender, Anna Bernasconi, Carsten Damm, Joachim, Michael E. Saks, Igor Shparlinski posted to cdpublist by damm on 2008-03-11 15:49:45 as
	On relations between counting communication complexity classes. [My Copy] J. Comput. Syst. Sci., Vol. 69, No. 2. (2004), pp. 259-280. by Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack posted to cdpublist by damm on 2008-03-11 15:49:44 as
	Score-based prediction of genomic islands in prokaryotic genomes using hidden Markov models. [My Copy] BMC Bioinformatics, Vol. 7 (2006) by Stephan Waack, Oliver Keller, Roman Asper, et al.Thomas Brodag, Carsten Damm, Wolfgang F. Fricke, Katharina Surovcik, Peter Meinicke, Rainer Merkl posted to cdpublist by damm on 2008-03-11 15:49:44 as
	On approximation by XOR-OBDDs. [My Copy] Inf. Process. Lett., Vol. 102, No. 1. (2007), pp. 17-21. by Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack posted to cdpublist by damm on 2008-03-11 15:49:44 as

Note: You may cite this page as: http://www.citeulike.org/user/damm/tag/cdpublist

RIS BibTeX RTF/PDF

damm's cdpublist [34 articles]

Tag selected articles

damm's tags