| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ulrich Hertrampf, Christoph Minnameier |
Resource Bounded Frequency Computations with Three Errors.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Christoph Minnameier |
Resource Bounded Frequency Computations with Three Errors. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen |
Regular frequency computations. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Austinat, Volker Diekert, Ulrich Hertrampf |
A structural property of regular frequency computations. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Steffen Reith, Heribert Vollmer |
A note on closure properties of logspace MOD classes. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Quantencomputer - Aktuelles Schlagwort. |
Informatik Spektrum |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Algebraic acceptance mechanisms for polynomial time machines. |
SIGACT News |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Generalized Regular Counting Classes. |
MFCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner |
The Chain Method to Separate Counting Classes. |
Theory Comput. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
The Inherent Dimension of Bounded Counting Classes. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
The Shapes of Trees. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Acceptance by Transformation Monoids (with an Application to Local Self Reductions). (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
local self reduction, bottleneck machine, structural complexity |
| 1 | Ulrich Hertrampf |
On the Acceptance Power of Groups and Semigroups |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1996 |
RDF |
|
| 1 | Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner |
On Balanced Versus Unbalanced Computation Trees. |
Mathematical Systems Theory |
1996 |
DBLP BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Classes of Bounded Counting Type and their Inclusion Relations. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner |
On the Power of Number-Theoretic Operations with Respect to Counting. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Ulrich Hertrampf |
Depth Reduction for Circuits of Unbounded Fan-In |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Complexity Classes with Finite Acceptance Types. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Complexity Classes Defined via k-valued Functions. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Complexity Classes with Finite Acceptance Types |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1993 |
RDF |
|
| 1 | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner |
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner |
On the Power of Polynomial Bit-Reductions |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1992 |
RDF |
|
| 1 | Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel |
Structure and Importance of Logspace-MOD Class. |
Mathematical Systems Theory |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Locally Definable Acceptance Types - The Three-Valued Case. |
LATIN |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Locally Definable Acceptance Types for Polynomial Time Machines. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel |
Structure and Importance of Logspace-MOD-Classes. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf |
Relations Among Mod-Classes. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Ulrich Hertrampf |
On the Power of Uniform Families of Constant Depth Treshold Circuits. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel, John Gill, Ulrich Hertrampf |
Counting Classes: Thresholds, Parity, Mods, and Fewness. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Hertrampf, Klaus W. Wagner |
Interactive Proof Systems: Provers, Rounds, and Error Bounds. |
CSL |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")