| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 1998 | |
|---|---|---|
| 5 |      | Hans-Jörg Burtschick, Heribert Vollmer: Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998) |
| 1997 | ||
| 4 |  | Hans-Jörg Burtschick, W. Lindner: On Sets Turing Reducible to p-Selective Sets. Theory Comput. Syst. 30(2): 135-143 (1997) |
| 1996 | ||
| 3 | | Hans-Jörg Burtschick, Heribert Vollmer: Lindstroem Quantifiers and Leaf Language Definability Electronic Colloquium on Computational Complexity (ECCC) 3(5): (1996) |
| 1995 | ||
| 2 | | Hans-Jörg Burtschick: Comparing Counting Classes for Logspace, One-way Logspace, and First-order. MFCS 1995: 139-148 |
| 1992 | ||
| 1 | | Hans-Jörg Burtschick, Albrecht Hoene: The Degree Structure of 1-L Reductions. MFCS 1992: 153-161 |
| 1 | Albrecht Hoene | [1] |
| 2 | W. Lindner | [4] |
| 3 | Heribert Vollmer | [3] [5] |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page