default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Hertrampf
Person information
- affiliation: University of Stuttgart, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[b2]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf:
Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups. de Gruyter 2016, ISBN 978-3-11-041332-8, pp. I-XII, 1-342- 2010
- [j12]Ulrich Hertrampf, Christoph Minnameier:
Resource Bounded Frequency Computations with Three Errors. Algorithmica 56(3): 342-363 (2010)
2000 – 2009
- 2008
- [c18]Ulrich Hertrampf, Christoph Minnameier:
Resource Bounded Frequency Computations with Three Errors. COCOON 2008: 72-81 - 2005
- [j11]Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen:
Regular frequency computations. Theor. Comput. Sci. 330(1): 15-21 (2005) - 2003
- [j10]Holger Austinat, Volker Diekert, Ulrich Hertrampf:
A structural property of regular frequency computations. Theor. Comput. Sci. 292(1): 33-43 (2003) - 2000
- [j9]Ulrich Hertrampf:
Quantencomputer - Aktuelles Schlagwort. Inform. Spektrum 23(5): 322-324 (2000) - [j8]Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000) - [j7]Ulrich Hertrampf:
Algebraic acceptance mechanisms for polynomial time machines. SIGACT News 31(2): 22-33 (2000)
1990 – 1999
- 1999
- [c17]Ulrich Hertrampf:
Generalized Regular Counting Classes. MFCS 1999: 419-429 - 1998
- [j6]K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998) - [c16]Ulrich Hertrampf:
The Inherent Dimension of Bounded Counting Classes. COCOON 1998: 157-166 - 1997
- [c15]Ulrich Hertrampf:
Acceptance by Transformation Monoids (with an Application to Local Self Reductions). CCC 1997: 213-224 - [c14]Ulrich Hertrampf:
The Shapes of Trees. COCOON 1997: 412-421 - [c13]Ulrich Hertrampf:
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria. FCT 1997: 233-244 - 1996
- [j5]Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory 29(4): 411-421 (1996) - [i3]Ulrich Hertrampf:
On the Acceptance Power of Groups and Semigroups. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-07 (1996) - 1995
- [c12]Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting. SCT 1995: 299-314 - [c11]Ulrich Hertrampf:
Classes of Bounded Counting Type and their Inclusion Relations. STACS 1995: 60-70 - 1994
- [j4]Eric Allender, Ulrich Hertrampf:
Depth Reduction for Circuits of Unbounded Fan-In. Inf. Comput. 112(2): 217-238 (1994) - [c10]Ulrich Hertrampf:
Complexity Classes Defined via k-valued Functions. SCT 1994: 224-234 - [c9]Ulrich Hertrampf:
Complexity Classes with Finite Acceptance Types. STACS 1994: 543-553 - 1993
- [j3]Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer:
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. 115(2): 225-241 (1993) - [c8]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT 1993: 200-207 - [i2]Ulrich Hertrampf:
Complexity Classes with Finite Acceptance Types. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-16 (1993) - 1992
- [j2]Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD Class. Math. Syst. Theory 25(3): 223-237 (1992) - [c7]Ulrich Hertrampf:
Locally Definable Acceptance Types - The Three-Valued Case. LATIN 1992: 262-271 - [c6]Ulrich Hertrampf:
Locally Definable Acceptance Types for Polynomial Time Machines. STACS 1992: 199-207 - [i1]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Bit-Reductions. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28 (1992) - 1991
- [c5]Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD-Classes. STACS 1991: 360-371 - 1990
- [j1]Ulrich Hertrampf:
Relations Among Mod-Classes. Theor. Comput. Sci. 74(3): 325-328 (1990) - [c4]Ulrich Hertrampf, Klaus W. Wagner:
Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL 1990: 261-273 - [c3]Eric Allender, Ulrich Hertrampf:
On the Power of Uniform Families of Constant Depth Treshold Circuits. MFCS 1990: 158-164 - [c2]Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer:
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS 1990: 1-11 - [c1]Richard Beigel, John Gill, Ulrich Hertrampf:
Counting Classes: Thresholds, Parity, Mods, and Fewness. STACS 1990: 49-57
1980 – 1989
- 1987
- [b1]Ulrich Hertrampf:
Text und Grafik mit Zeichensätzen. University of Augsburg, Germany, 1987, pp. 1-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
