Ulrich Hertrampf

35 papers A 7B 5Misc 3Journal 15Unranked 3

Year	Rank	Type	Title / Venue / Authors
2016	—	`book`	Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups. Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf
2010	J	`jnl`	Resource Bounded Frequency Computations with Three Errors. Algorithmica Ulrich Hertrampf, Christoph Minnameier
2008	Misc	`conf`	Resource Bounded Frequency Computations with Three Errors. COCOON Ulrich Hertrampf, Christoph Minnameier
2005	J	`jnl`	Regular frequency computations. Theor. Comput. Sci. Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
2003	J	`jnl`	A structural property of regular frequency computations. Theor. Comput. Sci. Holger Austinat, Volker Diekert, Ulrich Hertrampf
2000	J	`jnl`	A note on closure properties of logspace MOD classes. Inf. Process. Lett. Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
2000	J	`jnl`	Algebraic acceptance mechanisms for polynomial time machines. SIGACT News Ulrich Hertrampf
2000	J	`jnl`	Quantencomputer - Aktuelles Schlagwort. Inform. Spektrum Ulrich Hertrampf
1999	B	`conf`	Generalized Regular Counting Classes. MFCS Ulrich Hertrampf
1998	J	`jnl`	The Chain Method to Separate Counting Classes. Theory Comput. Syst. K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1998	Misc	`conf`	The Inherent Dimension of Bounded Counting Classes. COCOON Ulrich Hertrampf
1997	A	`conf`	Acceptance by Transformation Monoids (with an Application to Local Self Reductions). CCC Ulrich Hertrampf
1997	B	`conf`	Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. FCT Ulrich Hertrampf
1997	Misc	`conf`	The Shapes of Trees. COCOON Ulrich Hertrampf
1996	J	`jnl`	On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1996	J	`jnl`	On the Acceptance Power of Groups and Semigroups Universität Trier, Mathematik/Informatik, Forschungsbericht Ulrich Hertrampf
1995	A	`conf`	Classes of Bounded Counting Type and their Inclusion Relations. STACS Ulrich Hertrampf
1995	—	`conf`	On the Power of Number-Theoretic Operations with Respect to Counting. SCT Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1994	—	`conf`	Complexity Classes Defined via k-valued Functions. SCT Ulrich Hertrampf
1994	A	`conf`	Complexity Classes with Finite Acceptance Types. STACS Ulrich Hertrampf
1994	J	`jnl`	Depth Reduction for Circuits of Unbounded Fan-In Inf. Comput. Eric Allender, Ulrich Hertrampf
1993	J	`jnl`	Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
1993	J	`jnl`	Complexity Classes with Finite Acceptance Types Universität Trier, Mathematik/Informatik, Forschungsbericht Ulrich Hertrampf
1993	—	`conf`	On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1992	B	`conf`	Locally Definable Acceptance Types - The Three-Valued Case. LATIN Ulrich Hertrampf
1992	A	`conf`	Locally Definable Acceptance Types for Polynomial Time Machines. STACS Ulrich Hertrampf
1992	J	`jnl`	On the Power of Polynomial Bit-Reductions Universität Trier, Mathematik/Informatik, Forschungsbericht Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1992	J	`jnl`	Structure and Importance of Logspace-MOD Class. Math. Syst. Theory Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
1991	A	`conf`	Structure and Importance of Logspace-MOD-Classes. STACS Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
1990	A	`conf`	A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
1990	A	`conf`	Counting Classes: Thresholds, Parity, Mods, and Fewness. STACS Richard Beigel, John Gill, Ulrich Hertrampf
1990	B	`conf`	Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL Ulrich Hertrampf, Klaus W. Wagner
1990	B	`conf`	On the Power of Uniform Families of Constant Depth Treshold Circuits. MFCS Eric Allender, Ulrich Hertrampf
1990	J	`jnl`	Relations Among Mod-Classes. Theor. Comput. Sci. Ulrich Hertrampf
1987	—	`—`	Text und Grafik mit Zeichensätzen. Ulrich Hertrampf