Travelled to:1 × Finland
1 × France
1 × Greece
1 × Japan
1 × USA
2 × Germany
Collaborated with:∅ V.L.Selivanov U.Hertrampf C.Glaßer S.D.Travers L.A.Hemaspaandra S.Kosub R.V.Book H.Vollmer
Talks about:complex (2) probabilist (1) correspond (1) hierarchi (1) restrict (1) question (1) quantifi (1) properti (1) polynomi (1) interact (1)
Person: Klaus W. Wagner
DBLP: Wagner:Klaus_W=
Contributed to:
20082006
20011996
199019881986Wrote 7 papers:
- DLT-2008-SelivanovW #complexity
- Complexity of Topological Properties of Regular ω-Languages (VLS, KWW), pp. 529–542.
- DLT-2006-GlasserTW #polynomial
- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (CG, SDT, KWW), pp. 408–419.
- ICALP-2001-HemaspaandraKW #complexity
- The Complexity of Computing the Size of an Interval (LAH, SK, KWW), pp. 1040–1051.
- ICALP-1996-BookVW #on the #probability #quantifier
- On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.
- CSL-1990-HertrampfW #bound #fault #interactive #proving
- Interactive Proof Systems: Provers, Rounds, and Error Bounds (UH, KWW), pp. 261–273.
- ICALP-1988-Wagner #on the #strict
- On Restricting the Access to an NP-Oracle (KWW), pp. 682–696.
- ICALP-1986-Wagner
- More Complicated Questions About Maxima and Minima, and Some Closures of NP (KWW), pp. 434–443.