 |
Hertrampf
2009:
Komplexität der Geographie
Volker Diekert, Ulrich Hertrampf
In Diekert, Weicker, and Weicker, editors,
Informatik als Dialog zwischen Theorie und Anwendung, Vieweg+Teubner,
pages 119-132,
2009
pdf File
(©Vieweg+Teubner)
2005:
Regular Frequency Computations
Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
Theoretical Computer Science, vol. 330, no. 1, pp. 15-21 (2005)
pdf File
(© Elsevier).
2002:
A Structural Property of Regular Frequency Computations
Holger Austinat, Volker Diekert, Ulrich Hertrampf
Theoretical Computer Science, vol. 292, no. 1, pp. 33-43 (2003)
ps File
(© Elsevier).
1999:
Generalized Regular Counting Classes
U. Hertrampf
24th Symposium on Mathematical Foundations of Computer Science, MFCS 99,
LNCS 1672, 419 - 429, 1999.
1998:
The Chain Method to Separate Counting Classes.
K. Cronauer, U. Hertrampf, H. Vollmer, K.W. Wagner
Theory of Computing Systems 31, 93 - 108, 1998.
The Inherent Dimension of Bounded Counting Classes
U. Hertrampf
4th International Computing and Combinatorics Conference,
LNCS 1449, 157 - 166, 1998.
1997:
Acceptance by Transformation Monoids
(with an Application to Local Self Reductions)
U. Hertrampf
12th Conference on Computational Complexity,
IEEE Computer Society Press, 213 - 224, 1997.
Polynomial Time Machines Equipped with Word Problems
over Algebraic Structures as their Acceptance Criteria
U. Hertrampf
11th International Symposium on Fundamentals of Computation Theory,
LNCS 1279, 233 - 244, 1997.
The Shapes of Trees
U. Hertrampf
3rd International Computing and Combinatorics Conference,
LNCS 1276, 412 - 421, 1997.
1996:
On Balanced vs. Unbalanced Computation Trees
U. Hertrampf, H. Vollmer, K.W. Wagner
Mathematical Systems Theory 29, 411 - 421, 1996.
1995:
Classes of Bounded Counting Type and their Inclusion Relations
U. Hertrampf
12th Symp. on Theoretical Aspects of Computer Science,
LNCS 900, 60 - 70, 1995.
On the Power of Number-theoretic Operations with respect to Counting
U. Hertrampf, H. Vollmer, K.W. Wagner
10th Conference on Structure in Complexity Theory,
IEEE Computer Society Press, 299 - 314, 1995.
1994:
Depth Reduction for Circuits of Unbounded Fan-In
E. Allender, U. Hertrampf
Information and Computation 112(2), 217 - 238, 1994.
Complexity Classed Defined via k-valued Functions
U. Hertrampf
9th Conference on Structure in Complexity Theory, IEEE Computer Society Press, 224 -
234, 1994.
Complexity Classes with Finite Acceptance Type
U. Hertrampf
11th Symp. on Theoretical Aspects of Computer Science,
LNCS 775, 543 - 553, 1994.
1993:
Almost-everywhere Complexity Hierarchies for Nondeterministic Time
E. Allender, R. Beigel, U. Hertrampf, S. Homer
Theoretical Computer Science 115(2), 225 - 242, 1993.
On the Power of Polynomial Time Bit-Reductions
U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner
8th Conference on Structure in Complexity Theory,
IEEE Computer Society Press, 200 - 207, 1993.
1992:
Structure and Importance of Logspace-MOD-Classes
G. Buntrock, C. Damm, U. Hertrampf, C. Meinel
Mathematical Systems Theory 25, 223 - 237, 1992.
Locally Definable Acceptance Types - The Three-Valued Case
U. Hertrampf
1st Latin American Symp. on Theoretical Informatics,
LNCS 583, 262 - 271, 1992.
Locally Definable Acceptance Types for Polynomial Time Machines
U. Hertrampf
9th Symp. on Theoretical Aspects of Computer Science,
LNCS 577, 199 - 207, 1992.
1991:
Interactive Proof Systems: Provers, Rounds, and Error Bounds
U. Hertrampf, K.W. Wagner
4th Workshop Computer Science Logic, CSL '90,
LNCS 533, 261 - 273, 1991.
1990:
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time
E. Allender, R. Beigel, U. Hertrampf, S. Homer
7th Symp. on Theoretical Aspects of Computer Science, LNCS 415, 1 - 11, 1990.
On the Power of Uniform Families of Constant Depth Threshold
Circuits
E. Allender, U. Hertrampf
15th Symp. on Mathematical Foundations of Computer Science,
LNCS 452, 158 - 164, 1990.
Counting Classes: Thresholds, Parity, Mods, and Fewness
R. Beigel, J. Gill, U. Hertrampf
7th Symp. on Theoretical Aspects of Computer Science, LNCS 415, 49 - 57, 1990.
Relations among MOD-Classes
U. Hertrampf
Theoretical Computer Science 74, 325 - 329, 1990.
|
|
