Find:
Searching for PHRASE carsten damm.
Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
28 documents found. Order: number of citations.

Structure and Importance of Logspace-MOD-Classes - Buntrock, Damm, Hertrampf.. (1992)   (Correct)   (19 citations)
of Logspace-MOD-Classes Gerhard Buntrock y Carsten Damm z Ulrich Hertrampf Christoph Meinel y
of Logspace-MOD-Classes Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
www.informatik.uni-trier.de/~damm/Papers/BDHM92.ps.gz

Inductive Counting For Width-Restricted Branching Programs - Damm, Holzer (1996)   (Correct)   (4 citations)
For Width-Restricted Branching Programs Carsten Damm 1 and Markus Holzer 23 1 FB
Branching Programs Send Correspondence To: Carsten Damm Universitat Trier Fachbereich Iv -
www.informatik.uni-trier.de/~damm/Papers/DH96.ps.gz

Symmetric Functions in AC 0 [2] - Damm, Lenz (1993)   (Correct)   (2 citations)
Nr. 93-05 Symmetric Functions in AC 0 2] Carsten Damm Katja Lenz Symmetric Functions in AC 0
Katja Lenz Symmetric Functions in AC 0 2] Carsten Damm z Katja Lenz x Abstract We consider
ftp.informatik.uni-trier.de/pub/Users-Root/reports/93-05.ps

Some Bounds on Multiparty Communication Complexity of.. - Damm, Jukna, Sgall (1996)   (Correct)   (1 citation)
Communication Complexity Of Pointer Jumping 1 Carsten Damm, Stasys Jukna And Ji R' I Sgall Abstract. We
March 25, 1996 Revised: August 19, 1996 Carsten Damm Fachbereich IV -Informatik Universitat
lovelace.thi.informatik.uni-frankfurt.de/%7Ejukna/ftp/pointer.ps

The Complexity of Tensor Calculus - Damm, Holzer, McKenzie (2000)   (Correct)   (1 citation)
The Complexity of Tensor Calculus Carsten Damm Institut fur Angewandte und Numerische
Press. The Complexity of Tensor Calculus Carsten Damm, Markus Holzer, Pierre McKenzie
www.iro.umontreal.ca/~mckenzie/dahomc00.ps

On Relations Between Counting Communication Complexity.. - Damm, Krause, Meinel, Waack   (Correct)   (1 citation)
Counting Communication Complexity Classes Carsten Damm Fb Iv-Informatik Universitat Trier D-54286
[3] Carsten Damm, Matthias Krause, Christoph Meinel, and
www.num.math.uni-goettingen.de/waack/papiere-html/dkmw97-revised.ps

Expressing Uniformity via Oracles - Damm, Holzer, Rossmanith (1997)   (Correct)   (1 citation)
Nr. 95-01 Expressing Uniformity via Oracles Carsten Damm Markus Holzer Peter Rossmanith Expressing
Expressing Uniformity via Oracles Carsten Damm y Markus Holzer zy Peter Rossmanith zx
www-ti.informatik.uni-tuebingen.de/~holzer/pub-holzer/TR95-01.ps.gz

Circuit and Decision Tree Complexity of Some Number.. - Bernasconi, Damm.. (1998)   (Correct)   (1 citation)
Number Theoretic Problems Anna Bernasconi, Carsten Damm, y and Igor Shparlinski z Abstract We
Some Number Theoretic Problems Anna Bernasconi, Carsten Damm, Igor Shparlinski
www.comp.mq.edu.au/~igor/BDS.ps

Parallel Complexity of Iterated Morphisms and the.. - Damm, Holzer, Lange (1992)   (Correct)   (1 citation)
Morphisms and the Arithmetic of Small Numbers Carsten Damm y Markus Holzer y Klaus-Jorn Lange y
Morphisms and the Arithmetic of Small Numbers Carsten Damm, Markus Holzer, Klaus-Jörn Lange
www-fs.informatik.uni-tuebingen.de/~holzer/pub-holzer/par-comp.ps.gz

On the Average Sensitivity of Testing Square-Free Numbers - Bernasconi, Damm, al. (1998)   (Correct)   (1 citation)
Germany bernasco@informatik.tu-muenchen.de Carsten Damm Fachbereich fur Informatik Universitat Trier,
of Testing Square-Free Numbers Anna Bernasconi, Carsten Damm, et al.
www.comp.mq.edu.au/~igor/SF_AvSens.ps

On the Complexity of Some Arithmetic Problems over F2[T] - Allender, Bernasconi, Damm, ..   (Correct)
di Pisa, Pisa 56125, Italy annab@di.unipi.it Carsten Damm Institut fur Numerische und Angewandte
over F2[T] Eric Allender, Anna Bernasconi, Carsten Damm, et al.
ftp.cs.rutgers.edu/pub/allender/gf2.pdf

Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, ..   (Correct)
Are Of Very Low Complexity: D0l Is In Ac 0 Carsten Damm Fb Iv {Informatik Universitat Trier
are of Very Low Complexity: D0L is in AC 0 Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter
flop.informatik.tu-muenchen.de/pub/theory/complexity/d0l.ps.gz

On the Complexity of Tensor Formulae - Damm (1999)   (Correct)
Nr. 99-20 On the Complexity of Tensor Formulae Carsten Damm On the Complexity of Tensor Formulae z
Damm On the Complexity of Tensor Formulae z Carsten Damm x Abstract We consider formulae on base of
ftp.informatik.uni-trier.de/pub/Users-Root/reports/99-20.ps

Automata That Take Advice - Damm, Holzer (1995)   (Correct)
Automata That Take Advice Carsten Damm 1 and Markus Holzer 23 1 FB
1995. Springer. Automata That Take Advice Carsten Damm, Markus Holzer
www-ti.informatik.uni-tuebingen.de/~holzer/pub-holzer/automata.ps.gz

4. GI Theorietag " Automaten und Formale Sprachen" - (ed.) (1995)   (Correct)
Languages under the fl-mode of Rewriting 12 Carsten Damm und Markus Holzer, Nichtuniforme regul are
Sprachen" 15:00-15:30 Kaffeepause 15:30-Carsten Damm, Nichtuniforme regul are Sprachen Christian
www-ti.informatik.uni-tuebingen.de/~holzer/pub-holzer/WSI-95-10.ps.gz

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
CiteSeer.IST - Copyright Penn State and NEC