Ulrich Hertrampf

According to our database, Ulrich Hertrampf authored at least 33 papers between 1987 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups.

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf

de Gruyter, ISBN: 978-3-11-041332-8, 2016

2010

Resource Bounded Frequency Computations with Three Errors.

Ulrich Hertrampf, Christoph Minnameier

Algorithmica, 2010

2005

Regular frequency computations.

Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen

Theor. Comput. Sci., 2005

2003

A structural property of regular frequency computations.

Holger Austinat, Volker Diekert, Ulrich Hertrampf

Theor. Comput. Sci., 2003

2000

Algebraic acceptance mechanisms for polynomial time machines.

Ulrich Hertrampf

SIGACT News, 2000

A note on closure properties of logspace MOD classes.

Ulrich Hertrampf, Steffen Reith, Heribert Vollmer

Inf. Process. Lett., 2000

Quantencomputer - Aktuelles Schlagwort.

Ulrich Hertrampf

Inform. Spektrum, 2000

1999

Generalized Regular Counting Classes.

Ulrich Hertrampf

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998

The Chain Method to Separate Counting Classes.

K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner

Theory Comput. Syst., 1998

The Inherent Dimension of Bounded Counting Classes.

Ulrich Hertrampf

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.

Ulrich Hertrampf

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

The Shapes of Trees.

Ulrich Hertrampf

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

Acceptance by Transformation Monoids (with an Application to Local Self Reductions).

Ulrich Hertrampf

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

On the Acceptance Power of Groups and Semigroups

Ulrich Hertrampf

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

On Balanced Versus Unbalanced Computation Trees.

Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner

Math. Syst. Theory, 1996

1995

Classes of Bounded Counting Type and their Inclusion Relations.

Ulrich Hertrampf

Proceedings of the STACS 95, 1995

On the Power of Number-Theoretic Operations with Respect to Counting.

Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994

Depth Reduction for Circuits of Unbounded Fan-In

Eric Allender, Ulrich Hertrampf

Inf. Comput., August, 1994

Complexity Classes Defined via k-valued Functions.

Ulrich Hertrampf

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Complexity Classes with Finite Acceptance Types

Ulrich Hertrampf

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Almost-Everywhere Complexity Hierarchies for Nondeterministic Time.

Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer

Theor. Comput. Sci., 1993

On the Power of Polynomial Time Bit-Reductions (Extended Abstract).

Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

On the Power of Polynomial Bit-Reductions

Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Structure and Importance of Logspace-MOD Class.

Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel

Math. Syst. Theory, 1992

Locally Definable Acceptance Types for Polynomial Time Machines.

Ulrich Hertrampf

Proceedings of the STACS 92, 1992

Locally Definable Acceptance Types - The Three-Valued Case.

Ulrich Hertrampf

Proceedings of the LATIN '92, 1992

1991

Structure and Importance of Logspace-MOD-Classes.

Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel

Proceedings of the STACS 91, 1991

1990

Relations Among Mod-Classes.

Ulrich Hertrampf

Theor. Comput. Sci., 1990

Counting Classes: Thresholds, Parity, Mods, and Fewness.

Richard Beigel, John Gill, Ulrich Hertrampf

Proceedings of the STACS 90, 1990

A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time.

Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer

Proceedings of the STACS 90, 1990

On the Power of Uniform Families of Constant Depth Treshold Circuits.

Eric Allender, Ulrich Hertrampf

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Interactive Proof Systems: Provers, Rounds, and Error Bounds.

Ulrich Hertrampf, Klaus W. Wagner

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1987

Text und Grafik mit Zeichensätzen.

Ulrich Hertrampf

PhD thesis, 1987