Ulrich Hertrampf

Publication Activity (10 Years)

Years Active: 1990-2010
Publications (10 Years): 0

University of Augsburg, Germany (PHD)

Education History

University of Augsburg, Germany

PHD

Publications

Ulrich Hertrampf, Christoph Minnameier
Resource Bounded Frequency Computations with Three Errors. Algorithmica 56 (3) (2010)
Ulrich Hertrampf, Christoph Minnameier
Resource Bounded Frequency Computations with Three Errors. COCOON (2008)
Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
Regular frequency computations. Theor. Comput. Sci. 330 (1) (2005)
Holger Austinat, Volker Diekert, Ulrich Hertrampf
A structural property of regular frequency computations. Theor. Comput. Sci. 292 (1) (2003)
Ulrich Hertrampf
Algebraic acceptance mechanisms for polynomial time machines. SIGACT News 31 (2) (2000)
Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75 (3) (2000)
Ulrich Hertrampf
Quantencomputer - Aktuelles Schlagwort. Inform. Spektrum 23 (5) (2000)
Ulrich Hertrampf
Generalized Regular Counting Classes. MFCS (1999)
K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31 (1) (1998)
Ulrich Hertrampf
The Inherent Dimension of Bounded Counting Classes. COCOON (1998)
Ulrich Hertrampf
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. FCT (1997)
Ulrich Hertrampf
Acceptance by Transformation Monoids (with an Application to Local Self Reductions). Computational Complexity Conference (1997)
Ulrich Hertrampf
The Shapes of Trees. COCOON (1997)
Ulrich Hertrampf
On the Acceptance Power of Groups and Semigroups Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory 29 (4) (1996)
Ulrich Hertrampf
Classes of Bounded Counting Type and their Inclusion Relations. STACS (1995)
Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
On the Power of Number-Theoretic Operations with Respect to Counting. Computational Complexity Conference (1995)
Eric Allender, Ulrich Hertrampf
Depth Reduction for Circuits of Unbounded Fan-In Inf. Comput. 112 (2) (1994)
Ulrich Hertrampf
Complexity Classes Defined via k-valued Functions. Computational Complexity Conference (1994)
Ulrich Hertrampf
Complexity Classes with Finite Acceptance Types. STACS (1994)
Ulrich Hertrampf
Complexity Classes with Finite Acceptance Types Universität Trier, Mathematik/Informatik, Forschungsbericht (1993)
Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. 115 (2) (1993)
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Computational Complexity Conference (1993)
Ulrich Hertrampf
Locally Definable Acceptance Types for Polynomial Time Machines. STACS (1992)
Ulrich Hertrampf
Locally Definable Acceptance Types - The Three-Valued Case. LATIN (1992)
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)
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
Structure and Importance of Logspace-MOD Class. Math. Syst. Theory 25 (3) (1992)
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
Structure and Importance of Logspace-MOD-Classes. STACS (1991)
Eric Allender, Ulrich Hertrampf
On the Power of Uniform Families of Constant Depth Treshold Circuits. MFCS (1990)
Ulrich Hertrampf
Relations Among Mod-Classes. Theor. Comput. Sci. 74 (3) (1990)
Ulrich Hertrampf, Klaus W. Wagner
Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL (1990)
Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS (1990)
Richard Beigel, John Gill, Ulrich Hertrampf
Counting Classes: Thresholds, Parity, Mods, and Fewness. STACS (1990)

Ulrich Hertrampf.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Ulrich Hertrampf