Ulrich Hertrampf

According to our database1, Ulrich Hertrampf
  • authored at least 35 papers between 1987 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups.
de Gruyter, ISBN: 978-3-11-041332-8, 2016

2010
Resource Bounded Frequency Computations with Three Errors.
Algorithmica, 2010

2008
Resource Bounded Frequency Computations with Three Errors.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2005
Regular frequency computations.
Theor. Comput. Sci., 2005

2003
A structural property of regular frequency computations.
Theor. Comput. Sci., 2003

2000
Algebraic acceptance mechanisms for polynomial time machines.
SIGACT News, 2000

A note on closure properties of logspace MOD classes.
Inf. Process. Lett., 2000

Quantencomputer - Aktuelles Schlagwort.
Informatik Spektrum, 2000

1999
Generalized Regular Counting Classes.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998
The Chain Method to Separate Counting Classes.
Theory Comput. Syst., 1998

The Inherent Dimension of Bounded Counting Classes.
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.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

The Shapes of Trees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

Acceptance by Transformation Monoids (with an Application to Local Self Reductions).
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
On the Acceptance Power of Groups and Semigroups
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

On Balanced Versus Unbalanced Computation Trees.
Mathematical Systems Theory, 1996

1995
Classes of Bounded Counting Type and their Inclusion Relations.
STACS, 1995

On the Power of Number-Theoretic Operations with Respect to Counting.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
Depth Reduction for Circuits of Unbounded Fan-In
Inf. Comput., August, 1994

Complexity Classes with Finite Acceptance Types.
Proceedings of the STACS 94, 1994

Complexity Classes Defined via k-valued Functions.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
Complexity Classes with Finite Acceptance Types
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Almost-Everywhere Complexity Hierarchies for Nondeterministic Time.
Theor. Comput. Sci., 1993

On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Structure and Importance of Logspace-MOD Class.
Mathematical Systems Theory, 1992

Locally Definable Acceptance Types for Polynomial Time Machines.
Proceedings of the STACS 92, 1992

Locally Definable Acceptance Types - The Three-Valued Case.
Proceedings of the LATIN '92, 1992

1991
Structure and Importance of Logspace-MOD-Classes.
Proceedings of the STACS 91, 1991

1990
Relations Among Mod-Classes.
Theor. Comput. Sci., 1990

Counting Classes: Thresholds, Parity, Mods, and Fewness.
Proceedings of the STACS 90, 1990

A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time.
Proceedings of the STACS 90, 1990

On the Power of Uniform Families of Constant Depth Treshold Circuits.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Interactive Proof Systems: Provers, Rounds, and Error Bounds.
Proceedings of the Computer Science Logic, 4th Workshop, 1990

1987
Text und Grafik mit Zeichensätzen.
PhD thesis, 1987


  Loading...