 | 2008 |
|---|
| 31 |       | Ulrich Hertrampf,
Christoph Minnameier:
Resource Bounded Frequency Computations with Three Errors.
COCOON 2008: 72-81 |
| 2005 |
|---|
| 30 | | Holger Austinat,
Volker Diekert,
Ulrich Hertrampf,
Holger Petersen:
Regular frequency computations.
Theor. Comput. Sci. 330(1): 15-21 (2005) |
| 2003 |
|---|
| 29 |  | Holger Austinat,
Volker Diekert,
Ulrich Hertrampf:
A structural property of regular frequency computations.
Theor. Comput. Sci. 292(1): 33-43 (2003) |
| 2000 |
|---|
| 28 | | Ulrich Hertrampf,
Steffen Reith,
Heribert Vollmer:
A note on closure properties of logspace MOD classes.
Inf. Process. Lett. 75(3): 91-93 (2000) |
| 27 | | Ulrich Hertrampf:
Quantencomputer - Aktuelles Schlagwort.
Informatik Spektrum 23(5): 322-324 (2000) |
| 1999 |
|---|
| 26 | | Ulrich Hertrampf:
Generalized Regular Counting Classes.
MFCS 1999: 419-429 |
| 1998 |
|---|
| 25 | | Ulrich Hertrampf:
The Inherent Dimension of Bounded Counting Classes.
COCOON 1998: 157-166 |
| 24 | | K. Cronauer,
Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
The Chain Method to Separate Counting Classes.
Theory Comput. Syst. 31(1): 93-108 (1998) |
| 1997 |
|---|
| 23 | | Ulrich Hertrampf:
The Shapes of Trees.
COCOON 1997: 412-421 |
| 22 | | Ulrich Hertrampf:
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.
FCT 1997: 233-244 |
| 21 | | Ulrich Hertrampf:
Acceptance by Transformation Monoids (with an Application to Local Self Reductions).
IEEE Conference on Computational Complexity 1997: 213-224 |
| 1996 |
|---|
| 20 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees.
Mathematical Systems Theory 29(4): 411-421 (1996) |
| 19 | | Ulrich Hertrampf:
On the Acceptance Power of Groups and Semigroups
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-07: (1996) |
| 1995 |
|---|
| 18 | | Ulrich Hertrampf:
Classes of Bounded Counting Type and their Inclusion Relations.
STACS 1995: 60-70 |
| 17 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting.
Structure in Complexity Theory Conference 1995: 299-314 |
| 1994 |
|---|
| 16 | | Ulrich Hertrampf:
Complexity Classes with Finite Acceptance Types.
STACS 1994: 543-553 |
| 15 | | Ulrich Hertrampf:
Complexity Classes Defined via k-valued Functions.
Structure in Complexity Theory Conference 1994: 224-234 |
| 14 | | Eric Allender,
Ulrich Hertrampf:
Depth Reduction for Circuits of Unbounded Fan-In
Inf. Comput. 112(2): 217-238 (1994) |
| 1993 |
|---|
| 13 | | 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: 200-207 |
| 12 | | Eric Allender,
Richard Beigel,
Ulrich Hertrampf,
Steven Homer:
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time.
Theor. Comput. Sci. 115(2): 225-241 (1993) |
| 11 | | Ulrich Hertrampf:
Complexity Classes with Finite Acceptance Types
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-16: (1993) |
| 1992 |
|---|
| 10 | | Ulrich Hertrampf:
Locally Definable Acceptance Types - The Three-Valued Case.
LATIN 1992: 262-271 |
| 9 | | Ulrich Hertrampf:
Locally Definable Acceptance Types for Polynomial Time Machines.
STACS 1992: 199-207 |
| 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 | | Ulrich Hertrampf,
Clemens Lautemann,
Thomas Schwentick,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28: (1992) |
| 1991 |
|---|
| 6 | | Gerhard Buntrock,
Carsten Damm,
Ulrich Hertrampf,
Christoph Meinel:
Structure and Importance of Logspace-MOD-Classes.
STACS 1991: 360-371 |
| 1990 |
|---|
| 5 | | Ulrich Hertrampf,
Klaus W. Wagner:
Interactive Proof Systems: Provers, Rounds, and Error Bounds.
CSL 1990: 261-273 |
| 4 | | Eric Allender,
Ulrich Hertrampf:
On the Power of Uniform Families of Constant Depth Treshold Circuits.
MFCS 1990: 158-164 |
| 3 | | Eric Allender,
Richard Beigel,
Ulrich Hertrampf,
Steven Homer:
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time.
STACS 1990: 1-11 |
| 2 | | Richard Beigel,
John Gill,
Ulrich Hertrampf:
Counting Classes: Thresholds, Parity, Mods, and Fewness.
STACS 1990: 49-57 |
| 1 | | Ulrich Hertrampf:
Relations Among Mod-Classes.
Theor. Comput. Sci. 74(3): 325-328 (1990) |
