 | 
| |
Online DBLP entries are available for Erich Gradel and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- Erich Grädel,
Yuri Gurevich,
Colin Hirch:
The Complexity of Query Reliability.
PODS 1998: 227-234
- Erich Grädel,
Yuri Gurevich:
Metafinite Model Theory.
Information and Computation 140(1): 26-81 (1998)
- Erich Grädel,
Martin Otto,
Eric Rosen:
Two-Variable Logic with Counting is Decidable.
LICS 1997: 306-317
- Erich Grädel,
Martin Otto,
Eric Rosen:
Undecidability Results on Two-Variable Logics.
STACS 1997: 249-260
- Kevin J. Compton,
Erich Grädel:
Logical Definability of Counting Functions.
JCSS 53(2): 283-297 (1996)
- Anuj Dawar,
Erich Grädel:
Generalized Quantifiers and 0-1 Laws.
LICS 1995: 54-64
- Erich Grädel,
Klaus Meer:
Descriptive Complexity Theory over the Real Numbers.
STOC 1995: 315-324
- Erich Grädel,
Gregory L. McColm:
On the Power of Deterministic Transitive Closures.
Information and Computation 119(1): 129-135 (1995)
- Erich Grädel,
Yuri Gurevich:
Tailoring Recursing for Complexity.
ICALP 1994: 118-129
- Erich Grädel,
Anders Malmström:
Approximable Minimization Problems and Optimal Solutions on Random Inputs.
CSL 1993: 139-149
- Erich Grädel,
Martin Otto:
Inductive Definability with Counting on Finite Structures.
CSL 1992: 231-247
- Thomas Behrendt,
Kevin Compton,
Erich Grädel:
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
CSL 1992: 43-60
- Erich Grädel,
Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.
FOCS 1992: 167-176
- Erich Grädel,
Gregory L. McColm:
Deterministic vs. Nondeterministic Transitive Closure Logic.
LICS 1992: 58-63
- Erich Grädel:
Capturing Complexity Classes by Fragments of Second-Order Logic.
TCS 101(1): 35-57 (1992)
- Erich Grädel:
On Transitive Closure Logic.
CSL 1991: 149-163
- Erich Grädel:
The Expressive Power of Second Order Horn Logic.
STACS 1991: 466-477
- Erich Grädel:
Simple Sentences That Are Hard to Decide.
Information and Computation 94(1): 62-82 (1991)
- Erich Grädel:
Simple Interpretations Among Complicated Theories.
IPL 35(5): 235-238 (1990)
- Erich Grädel:
Domino Games and Complexity.
SIAM J. Comput. 19(5): 787-804 (1990)
- Erich Grädel:
On Logical Descriptions of Some Concepts in Structural Complexity Theory.
CSL 1989: 163-175
- Erich Grädel:
Complexity of Formula Classes in First Order Logic with Functions.
FCT 1989: 224-233
- Erich Grädel:
Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes.
CSL 1988: 118-137
- Erich Grädel:
Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations.
STACS 1988: 98-107
- Erich Grädel:
Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy.
TCS 56: 289-301 (1988)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
