| 2008 |
|---|
| 80 | EE | Anuj Dawar,
Erich Grädel:
The Descriptive Complexity of Parity Games.
CSL 2008: 354-368 |
| 79 | EE | Erich Grädel:
Banach-Mazur Games on Graphs.
FSTTCS 2008 |
| 78 | EE | Diana Fischer,
Erich Grädel,
Lukasz Kaiser:
Model Checking Games for the Quantitative µ-Calculus.
STACS 2008: 301-312 |
| 77 | EE | Diana Fischer,
Erich Grädel,
Lukasz Kaiser:
Model Checking Games for the Quantitative mu-Calculus
CoRR abs/0802.2871: (2008) |
| 2007 |
|---|
| 76 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict.
Theory Comput. Syst. 40(4): 437-466 (2007) |
| 2006 |
|---|
| 75 | EE | Samson Abramsky,
Erich Grädel,
Johann A. Makowsky:
The Ackermann Award 2006.
CSL 2006: 622-626 |
| 74 | EE | Erich Grädel,
Igor Walukiewicz:
Postinal Determinacy of Games with Infinitely Many Priorities
CoRR abs/cs/0610034: (2006) |
| 73 | EE | Erich Grädel,
Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities
CoRR abs/cs/0610035: (2006) |
| 72 | EE | Erich Grädel,
Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities.
Logical Methods in Computer Science 2(4): (2006) |
| 71 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Backtracking games and inflationary fixed points.
Theor. Comput. Sci. 350(2-3): 174-187 (2006) |
| 2005 |
|---|
| 70 | EE | Erich Grädel,
Janos Makowsky,
Alexander A. Razborov:
The Ackermann Award 2005.
CSL 2005: 557-565 |
| 2004 |
|---|
| 69 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Backtracking Games and Inflationary Fixed Points.
ICALP 2004: 420-432 |
| 68 | EE | Dietmar Berwanger,
Erich Grädel:
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.
LPAR 2004: 209-223 |
| 67 | EE | Erich Grädel:
Positional Determinacy of Infinite Games.
STACS 2004: 4-18 |
| 66 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Inflationary fixed points in modal logic.
ACM Trans. Comput. Log. 5(2): 282-315 (2004) |
| 65 | EE | Achim Blumensath,
Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations.
Theory Comput. Syst. 37(6): 641-674 (2004) |
| 64 | EE | Dietmar Berwanger,
Erich Grädel:
Fixed-Point Logics and Solitaire Games.
Theory Comput. Syst. 37(6): 675-694 (2004) |
| 2003 |
|---|
| 63 | EE | Erich Grädel,
Antje Nowack:
Quantum Computing and Abstract State Machines.
Abstract State Machines 2003: 309-323 |
| 62 | EE | Erich Grädel,
Stephan Kreutzer:
Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions.
LICS 2003: 158- |
| 61 | EE | Dietmar Berwanger,
Erich Grädel,
Stephan Kreutzer:
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games.
LPAR 2003: 229-243 |
| 60 | EE | Erich Grädel,
Joseph Y. Halpern,
Radha Jagadeesan,
Adolfo Piperno:
LICS 2001 special issue.
ACM Trans. Comput. Log. 4(3): 295 (2003) |
| 2002 |
|---|
| 59 | | Erich Grädel,
Wolfgang Thomas,
Thomas Wilke:
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]
Springer 2002 |
| 58 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
On the Variable Hierarchy of the Modal µ-Calculus.
CSL 2002: 352-366 |
| 57 | EE | Georg Gottlob,
Erich Grädel,
Helmut Veith:
Datalog LITE: a deductive query language with linear time model checking.
ACM Trans. Comput. Log. 3(1): 42-79 (2002) |
| 56 | EE | Erich Grädel,
Colin Hirsch,
Martin Otto:
Back and forth between guarded and modal logics.
ACM Trans. Comput. Log. 3(3): 418-463 (2002) |
| 55 | EE | Erich Grädel:
Model Checking Games.
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 54 | | Erich Grädel:
Guarded fixed point logics and the monadic theory of countable trees.
Theor. Comput. Sci. 288(1): 129-152 (2002) |
| 2001 |
|---|
| 53 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Inflationary Fixed Points in Modal Logic.
CSL 2001: 277-291 |
| 52 | EE | Dietmar Berwanger,
Erich Grädel:
Games and Model Checking for Guarded Logics.
LPAR 2001: 70-84 |
| 51 | | Erich Grädel:
Why are Modal Logics so Robustly Decidable?
Current Trends in Theoretical Computer Science 2001: 393-408 |
| 2000 |
|---|
| 50 | EE | M.-Elisabeth Goncalves,
Erich Grädel:
Decidability issues for action guarded logics.
Description Logics 2000: 123-132 |
| 49 | EE | Erich Grädel,
Colin Hirsch,
Martin Otto:
Back and Forth between Guarded and Modal Logics.
LICS 2000: 217-228 |
| 48 | EE | Achim Blumensath,
Erich Grädel:
Automatic Structures.
LICS 2000: 51-62 |
| 47 | EE | Erich Grädel:
Efficient Evaluation Methods for Guarded Logics and Datalog LITE.
LPAR 2000: 417 |
| 1999 |
|---|
| 46 | EE | Erich Grädel:
Invited Talk: Decision procedures for guarded logics.
CADE 1999: 31-51 |
| 45 | | Erich Grädel,
Stephan Kreutzer:
Descriptive Complexity Theory for Constraint Databases.
CSL 1999: 67-81 |
| 44 | EE | Erich Grädel,
Eric Rosen:
Two-Variable Descriptions of Regularity.
LICS 1999: 14-23 |
| 43 | EE | Erich Grädel,
Igor Walukiewicz:
Guarded Fixed Point Logic.
LICS 1999: 45-54 |
| 42 | EE | Erich Grädel,
Marc Spielmann:
Logspace Reducibility via Abstract State Machines.
World Congress on Formal Methods 1999: 1738-1757 |
| 41 | EE | Erich Grädel,
Anders Malmström:
0-1 laws for recursive structures.
Arch. Math. Log. 38(4-5): 205-215 (1999) |
| 40 | EE | Erich Grädel,
Martin Otto,
Eric Rosen:
Undecidability results on two-variable logics.
Arch. Math. Log. 38(4-5): 313-354 (1999) |
| 39 | | Erich Grädel:
Why are Modal Logics so Robustly Decidable?
Bulletin of the EATCS 68: 90-103 (1999) |
| 38 | | Erich Grädel:
On The Restraining Power of Guards.
J. Symb. Log. 64(4): 1719-1742 (1999) |
| 37 | | Erich Grädel,
Eric Rosen:
On Preservation Theorems for Two-Variable Logic.
Math. Log. Q. 45: 315-325 (1999) |
| 36 | EE | Erich Grädel,
Martin Otto:
On Logics with Two Variables.
Theor. Comput. Sci. 224(1-2): 73-113 (1999) |
| 1998 |
|---|
| 35 | EE | Erich Grädel:
Description Logics and Guarded Fragments of First Order Logic.
Description Logics 1998 |
| 34 | EE | Erich Grädel,
Yuri Gurevich,
Colin Hirsch:
The Complexity of Query Reliability.
PODS 1998: 227-234 |
| 33 | | Erich Grädel,
Yuri Gurevich:
Metafinite Model Theory.
Inf. Comput. 140(1): 26-81 (1998) |
| 1997 |
|---|
| 32 | | Egon Börger,
Erich Grädel,
Yuri Gurevich:
The Classical Decision Problem
Springer 1997 |
| 31 | EE | Erich Grädel,
Martin Otto,
Eric Rosen:
Two-Variable Logic with Counting is Decidable.
LICS 1997: 306-317 |
| 30 | | Erich Grädel,
Martin Otto,
Eric Rosen:
Undecidability Results on Two-Variable Logics.
STACS 1997: 249-260 |
| 29 | EE | Erich Grädel,
Phokion G. Kolaitis,
Moshe Y. Vardi:
On the decision problem for two-variable first-order logic.
Bulletin of Symbolic Logic 3(1): 53-69 (1997) |
| 1996 |
|---|
| 28 | | Erich Grädel,
Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.
Ann. Pure Appl. Logic 77(2): 169-199 (1996) |
| 27 | | Kevin J. Compton,
Erich Grädel:
Logical Definability of Counting Functions.
J. Comput. Syst. Sci. 53(2): 283-297 (1996) |
| 1995 |
|---|
| 26 | | Anuj Dawar,
Erich Grädel:
Generalized Quantifiers and 0-1 Laws
LICS 1995: 54-64 |
| 25 | EE | Erich Grädel,
Klaus Meer:
Descriptive complexity theory over the real numbers.
STOC 1995: 315-324 |
| 24 | | Erich Grädel,
Gregory L. McColm:
On the Power of Deterministic Transitive Closures
Inf. Comput. 119(1): 129-135 (1995) |
| 23 | | Erich Grädel,
Yuri Gurevich:
Tailoring Recursion for Complexity.
J. Symb. Log. 60(3): 952-969 (1995) |
| 1994 |
|---|
| 22 | | Erich Grädel,
Yuri Gurevich:
Tailoring Recursing for Complexity.
ICALP 1994: 118-129 |
| 21 | | Erich Grädel,
Yuri Gurevich:
Metafinite Model Theory.
LCC 1994: 313-366 |
| 20 | | Kevin J. Compton,
Erich Grädel:
Logical Definability of Counting Functions.
Structure in Complexity Theory Conference 1994: 255-266 |
| 1993 |
|---|
| 19 | | Erich Grädel,
Anders Malmström:
Approximable Minimization Problems and Optimal Solutions on Random Inputs.
CSL 1993: 139-149 |
| 1992 |
|---|
| 18 | | Erich Grädel,
Martin Otto:
Inductive Definability with Counting on Finite Structures.
CSL 1992: 231-247 |
| 17 | | Thomas Behrendt,
Kevin J. Compton,
Erich Grädel:
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
CSL 1992: 43-60 |
| 16 | | Erich Grädel,
Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
FOCS 1992: 167-176 |
| 15 | | Erich Grädel,
Gregory L. McColm:
Deterministic vs. Nondeterministic Transitive Closure Logic
LICS 1992: 58-63 |
| 14 | | Erich Grädel:
Capturing Complexity Classes by Fragments of Second-Order Logic.
Theor. Comput. Sci. 101(1): 35-57 (1992) |
| 1991 |
|---|
| 13 | | Erich Grädel:
On Transitive Closure Logic.
CSL 1991: 149-163 |
| 12 | | Erich Grädel:
The Expressive Power of Second Order Horn Logic.
STACS 1991: 466-477 |
| 11 | | Erich Grädel:
Capturing Complexity Classes by Fragments of Second Order Logic.
Structure in Complexity Theory Conference 1991: 341-352 |
| 10 | | Erich Grädel:
Simple Sentences That Are Hard to Decide
Inf. Comput. 94(1): 62-82 (1991) |
| 1990 |
|---|
| 9 | | Erich Grädel:
Simple Interpretations Among Complicated Theories.
Inf. Process. Lett. 35(5): 235-238 (1990) |
| 8 | | Erich Grädel:
On the Notion of Linear Time Computability.
Int. J. Found. Comput. Sci. 1(3): 295-308 (1990) |
| 7 | | Erich Grädel:
Domino Games and Complexity.
SIAM J. Comput. 19(5): 787-804 (1990) |
| 1989 |
|---|
| 6 | | Erich Grädel:
On Logical Descriptions of Some Concepts in Structural Complexity Theory.
CSL 1989: 163-175 |
| 5 | | Erich Grädel:
Complexity of Formula Classes in First Order Logic with Functions.
FCT 1989: 224-233 |
| 4 | | Erich Grädel:
Dominoes and the Complexity of Subclasses of Logical Theories.
Ann. Pure Appl. Logic 43(1): 1-30 (1989) |
| 1988 |
|---|
| 3 | | Erich Grädel:
Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes.
CSL 1988: 118-137 |
| 2 | | Erich Grädel:
Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations.
STACS 1988: 98-107 |
| 1 | | Erich Grädel:
Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy.
Theor. Comput. Sci. 56: 289-301 (1988) |
