Ulrich Hertrampf

Ulrich Hertrampf, Christoph Minnameier: Resource Bounded Frequency Computations with Three Errors. Algorithmica 56(3): 342-363 (2010)

Ulrich Hertrampf, Christoph Minnameier: Resource Bounded Frequency Computations with Three Errors. COCOON 2008: 72-81

Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen: Regular frequency computations. Theor. Comput. Sci. 330(1): 15-21 (2005)

Holger Austinat, Volker Diekert, Ulrich Hertrampf: A structural property of regular frequency computations. Theor. Comput. Sci. 292(1): 33-43 (2003)

Ulrich Hertrampf: Quantencomputer - Aktuelles Schlagwort. Informatik Spektrum 23(5): 322-324 (2000)

Ulrich Hertrampf, Steffen Reith, Heribert Vollmer: A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000)

Ulrich Hertrampf: Algebraic acceptance mechanisms for polynomial time machines. SIGACT News 31(2): 22-33 (2000)

Ulrich Hertrampf: Generalized Regular Counting Classes. MFCS 1999: 419-429

K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998)

Ulrich Hertrampf: The Inherent Dimension of Bounded Counting Classes. COCOON 1998: 157-166

Ulrich Hertrampf: Acceptance by Transformation Monoids (with an Application to Local Self Reductions). IEEE Conference on Computational Complexity 1997: 213-224

Ulrich Hertrampf: The Shapes of Trees. COCOON 1997: 412-421

Ulrich Hertrampf: Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. FCT 1997: 233-244

Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: On Balanced Versus Unbalanced Computation Trees. Mathematical Systems Theory 29(4): 411-421 (1996)

Ulrich Hertrampf: On the Acceptance Power of Groups and Semigroups. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-07 (1996)

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

Ulrich Hertrampf: Classes of Bounded Counting Type and their Inclusion Relations. STACS 1995: 60-70

Eric Allender, Ulrich Hertrampf: Depth Reduction for Circuits of Unbounded Fan-In. Inf. Comput. 112(2): 217-238 (1994)

Ulrich Hertrampf: Complexity Classes Defined via k-valued Functions. Structure in Complexity Theory Conference 1994: 224-234

Ulrich Hertrampf: Complexity Classes with Finite Acceptance Types. STACS 1994: 543-553

Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer: Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. 115(2): 225-241 (1993)

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

Ulrich Hertrampf: Complexity Classes with Finite Acceptance Types. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-16 (1993)

Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel: Structure and Importance of Logspace-MOD Class. Mathematical Systems Theory 25(3): 223-237 (1992)

Ulrich Hertrampf: Locally Definable Acceptance Types - The Three-Valued Case. LATIN 1992: 262-271

Ulrich Hertrampf: Locally Definable Acceptance Types for Polynomial Time Machines. STACS 1992: 199-207

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)

Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel: Structure and Importance of Logspace-MOD-Classes. STACS 1991: 360-371

Ulrich Hertrampf: Relations Among Mod-Classes. Theor. Comput. Sci. 74(3): 325-328 (1990)

Ulrich Hertrampf, Klaus W. Wagner: Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL 1990: 261-273

Eric Allender, Ulrich Hertrampf: On the Power of Uniform Families of Constant Depth Treshold Circuits. MFCS 1990: 158-164

Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer: A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS 1990: 1-11

Richard Beigel, John Gill, Ulrich Hertrampf: Counting Classes: Thresholds, Parity, Mods, and Fewness. STACS 1990: 49-57