Ulrich Hertrampf - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2016

Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and GroupsVolker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf. de Gruyter, 2016. [doi]

2010

Resource Bounded Frequency Computations with Three ErrorsUlrich Hertrampf, Christoph Minnameier. algorithmica, 56(3):342-363, 2010. [doi]

2008

Resource Bounded Frequency Computations with Three ErrorsUlrich Hertrampf, Christoph Minnameier. cocoon 2008: 72-81 [doi]

2005

Regular frequency computationsHolger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen. TCS, 330(1):15-21, 2005. [doi]

2003

A structural property of regular frequency computationsHolger Austinat, Volker Diekert, Ulrich Hertrampf. TCS, 292(1):33-43, 2003.

2000

Quantencomputer - Aktuelles SchlagwortUlrich Hertrampf. insk, 23(5):322-324, 2000. [doi]

Algebraic acceptance mechanisms for polynomial time machinesUlrich Hertrampf. sigact, 31(2):22-33, 2000. [doi]

A note on closure properties of logspace MOD classesUlrich Hertrampf, Steffen Reith, Heribert Vollmer. ipl, 75(3):91-93, 2000. [doi]

1999

Generalized Regular Counting ClassesUlrich Hertrampf. mfcs 1999: 419-429

1998

The Chain Method to Separate Counting ClassesK. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. mst, 31(1):93-108, 1998.

The Inherent Dimension of Bounded Counting ClassesUlrich Hertrampf. cocoon 1998: 157-166 [doi]

1997

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

The Shapes of TreesUlrich Hertrampf. cocoon 1997: 412-421

Acceptance by Transformation Monoids (with an Application to Local Self Reductions)Ulrich Hertrampf. cocoon 1997: 213-224 [doi]

1996

On Balanced Versus Unbalanced Computation TreesUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. mst, 29(4):411-421, 1996.

1995

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

On the Power of Number-Theoretic Operations with Respect to CountingUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. cocoon 1995: 299-314

1994

Depth Reduction for Circuits of Unbounded Fan-InEric Allender, Ulrich Hertrampf. iandc, 112(2):217-238, August 1994.

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

Complexity Classes Defined via k-valued FunctionsUlrich Hertrampf. cocoon 1994: 224-234

1993

Almost-Everywhere Complexity Hierarchies for Nondeterministic TimeEric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer. TCS, 115(2):225-241, 1993.

On the Power of Polynomial Time Bit-Reductions (Extended Abstract)Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner. cocoon 1993: 200-207

1992

Structure and Importance of Logspace-MOD ClassGerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel. mst, 25(3):223-237, 1992.

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

Locally Definable Acceptance Types - The Three-Valued CaseUlrich Hertrampf. latin 1992: 262-271

1991

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

1990

1987

Text und Grafik mit ZeichensätzenUlrich Hertrampf. PhD thesis, University of Augsburg, Germany, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL