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 × Austria
1 × Latvia
1 × Spain
1 × USA
Collaborated with:
S.D.Travers H.Schmitz A.Pavan K.W.Wagner D.T.Nguyen C.Reitwießner A.L.Selman M.Witek
Talks about:
hierarchi (2) polynomi (2) time (2) correspond (1) autoreduc (1) alphabet (1) thérien (1) problem (1) perfect (1) complet (1)

Person: Christian Glaßer

DBLP DBLP: Gla=szlig=er:Christian

Contributed to:

ICALP (1) 20132013
LATA 20092009
DLT 20062006
DLT 20012001

Wrote 4 papers:

ICALP-v1-2013-GlasserNRSW #polynomial #reduction #set
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (CG, DTN, CR, ALS, MW), pp. 473–484.
LATA-2009-GlasserPT #fault tolerance #np-hard #problem
The Fault Tolerance of NP-Hard Problems (CG, AP, SDT), pp. 374–385.
DLT-2006-GlasserTW #polynomial
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (CG, SDT, KWW), pp. 408–419.
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets (CG, HS), pp. 251–261.

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.