BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × France
1 × Hungary
3 × Germany
Collaborated with:
T.Bakibayev D.Yang J.Kämper H.Fleischhack H.Huwig
Talks about:
time (4) polynomi (3) level (2) set (2) determinist (1) elementari (1) exponenti (1) disjunct (1) approxim (1) generic (1)

Person: Klaus Ambos-Spies

DBLP DBLP: Ambos-Spies:Klaus

Contributed to:

ICALP (1) 20102010
ICALP 19951995
CSL 19891989
CSL 19881988
CSL 19871987
ICALP 19841984

Wrote 6 papers:

ICALP-v1-2010-Ambos-SpiesB #exponential
Weak Completeness Notions for Exponential Time (KAS, TB), pp. 503–514.
ICALP-1995-Ambos-Spies #approximate #on the #polynomial
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (KAS), pp. 384–392.
CSL-1989-Ambos-SpiesY #polynomial #recursion #set
Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.
CSL-1988-Ambos-SpiesK #on the #self
On Disjunctive Self-Reducibility (KAS, JK), pp. 1–13.
CSL-1987-Ambos-SpiesFH #polynomial
Diagonalizing over Deterministic Polynomial Time (KAS, HF, HH), pp. 1–16.
ICALP-1984-Ambos-Spies #set
P-Generic Sets (KAS), pp. 58–68.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.