Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Erich Grädel
2010 – today
- 2013
[j36]- [j35]Erich Grädel: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493: 2-14 (2013)
- 2012
- [j34]Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich: Entanglement and the complexity of directed graphs. Theor. Comput. Sci. 463: 2-25 (2012)
- [c51]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa: Definability of linear equation systems over groups and rings. CSL 2012: 213-227
- [c50]
- [c49]
- [c48]Faried Abu Zaid, Erich Grädel, Lukasz Kaiser: The Field of Reals is not omega-Automatic. STACS 2012: 577-588
- [c47]Felix Canavoi, Erich Grädel, Roman Rabinovich: The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. GandALF 2012: 197-209
- [i5]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa: Definability of linear equation systems over groups and rings. CoRR abs/1204.3022 (2012)
- [i4]
- 2010
- [j33]Anuj Dawar, Erich Grädel: Properties of Almost All Graphs and Generalized Quantifiers. Fundam. Inform. 98(4): 351-372 (2010)
- [j32]Diana Fischer, Erich Grädel, Lukasz Kaiser: Model Checking Games for the Quantitative µ-Calculus. Theory Comput. Syst. 47(3): 696-719 (2010)
- [c46]
2000 – 2009
- 2009
- [c45]Erich Grädel, Lukasz Kaiser, Roman Rabinovich: Directed Graphs of Entanglement Two. FCT 2009: 169-180
- [e3]Erich Grädel, Reinhard Kahle (Eds.): Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5771, Springer 2009, ISBN 978-3-642-04026-9
- 2008
- [c44]
- [c43]
- [c42]Diana Fischer, Erich Grädel, Lukasz Kaiser: Model Checking Games for the Quantitative µ-Calculus. STACS 2008: 301-312
- [e2]Jörg Flum, Erich Grädel, Thomas Wilke (Eds.): Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games 2, Amsterdam University Press 2008, ISBN 978-90-5356-576-6
- [i3]Diana Fischer, Erich Grädel, Lukasz Kaiser: Model Checking Games for the Quantitative mu-Calculus. CoRR abs/0802.2871 (2008)
- 2007
- [j31]Dietmar Berwanger, Erich Grädel, Giacomo Lenzi: The Variable Hierarchy of the µ-Calculus Is Strict. Theory Comput. Syst. 40(4): 437-466 (2007)
- 2006
- [j30]Erich Grädel, Igor Walukiewicz: Positional Determinacy of Games with Infinitely Many Priorities. Logical Methods in Computer Science 2(4) (2006)
- [j29]Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006)
- [c41]
- [i2]Erich Grädel, Igor Walukiewicz: Postinal Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610034 (2006)
- [i1]Erich Grädel, Igor Walukiewicz: Positional Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610035 (2006)
- 2005
- [c40]
- 2004
- [j28]Achim Blumensath, Erich Grädel: Finite Presentations of Infinite Structures: Automata and Interpretations. Theory Comput. Syst. 37(6): 641-674 (2004)
- [j27]Dietmar Berwanger, Erich Grädel: Fixed-Point Logics and Solitaire Games. Theory Comput. Syst. 37(6): 675-694 (2004)
- [j26]Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary fixed points in modal logic. ACM Trans. Comput. Log. 5(2): 282-315 (2004)
- [c39]Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking Games and Inflationary Fixed Points. ICALP 2004: 420-432
- [c38]Dietmar Berwanger, Erich Grädel: Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. LPAR 2004: 209-223
- [c37]
- 2003
- [j25]Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno: LICS 2001 special issue. ACM Trans. Comput. Log. 4(3): 295 (2003)
- [c36]Erich Grädel, Antje Nowack: Quantum Computing and Abstract State Machines. Abstract State Machines 2003: 309-323
- [c35]Erich Grädel, Stephan Kreutzer: Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. LICS 2003: 158-
- [c34]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
- 2002
- [j24]
- [j23]Erich Grädel: Guarded fixed point logics and the monadic theory of countable trees. Theor. Comput. Sci. 288(1): 129-152 (2002)
- [j22]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)
- [j21]Erich Grädel, Colin Hirsch, Martin Otto: Back and forth between guarded and modal logics. ACM Trans. Comput. Log. 3(3): 418-463 (2002)
- [c33]Dietmar Berwanger, Erich Grädel, Giacomo Lenzi: On the Variable Hierarchy of the Modal µ-Calculus. CSL 2002: 352-366
- [e1]Erich Grädel, Wolfgang Thomas, Thomas Wilke (Eds.): Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lecture Notes in Computer Science 2500, Springer 2002, ISBN 3-540-00388-6
- 2001
- [c32]Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary Fixed Points in Modal Logic. CSL 2001: 277-291
- [c31]
- [p1]Erich Grädel: Why are Modal Logics so Robustly Decidable? Current Trends in Theoretical Computer Science 2001: 393-408
- 2000
- [c30]M.-Elisabeth Goncalves, Erich Grädel: Decidability issues for action guarded logics. Description Logics 2000: 123-132
- [c29]
- [c28]Erich Grädel, Colin Hirsch, Martin Otto: Back and Forth between Guarded and Modal Logics. LICS 2000: 217-228
- [c27]
1990 – 1999
- 1999
- [j20]Erich Grädel, Anders Malmström: 0-1 laws for recursive structures. Arch. Math. Log. 38(4-5): 205-215 (1999)
- [j19]Erich Grädel, Martin Otto, Eric Rosen: Undecidability results on two-variable logics. Arch. Math. Log. 38(4-5): 313-354 (1999)
- [j18]
- [j17]
- [j16]Erich Grädel, Eric Rosen: On Preservation Theorems for Two-Variable Logic. Math. Log. Q. 45: 315-325 (1999)
- [j15]Erich Grädel, Martin Otto: On Logics with Two Variables. Theor. Comput. Sci. 224(1-2): 73-113 (1999)
- [c26]
- [c25]Erich Grädel, Stephan Kreutzer: Descriptive Complexity Theory for Constraint Databases. CSL 1999: 67-81
- [c24]Erich Grädel, Marc Spielmann: Logspace Reducibility via Abstract State Machines. World Congress on Formal Methods 1999: 1738-1757
- [c23]
- [c22]
- 1998
- [j14]
- [c21]Erich Grädel: Description Logics and Guarded Fragments of First Order Logic. Description Logics 1998
- [c20]
- 1997
- [b2]Egon Börger, Erich Grädel, Yuri Gurevich: The Classical Decision Problem. Perspectives in Mathematical Logic, Springer 1997
- [j13]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)
- [c19]Erich Grädel, Martin Otto, Eric Rosen: Two-Variable Logic with Counting is Decidable. LICS 1997: 306-317
- [c18]Erich Grädel, Martin Otto, Eric Rosen: Undecidability Results on Two-Variable Logics. STACS 1997: 249-260
- 1996
- [j12]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)
- [j11]Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53(2): 283-297 (1996)
- 1995
- [j10]Erich Grädel, Gregory L. McColm: On the Power of Deterministic Transitive Closures. Inf. Comput. 119(1): 129-135 (1995)
- [j9]Erich Grädel, Yuri Gurevich: Tailoring Recursion for Complexity. J. Symb. Log. 60(3): 952-969 (1995)
- [c17]
- [c16]
- 1994
- [j8]Erich Grädel: Definability on finite structures and the existence of one-way functions. Meth. of Logic in CS 1(3): 299-314 (1994)
- [c15]Kevin J. Compton, Erich Grädel: Logical Definability of Counting Functions. Structure in Complexity Theory Conference 1994: 255-266
- [c14]
- [c13]
- 1993
- [c12]Erich Grädel, Anders Malmström: Approximable Minimization Problems and Optimal Solutions on Random Inputs. CSL 1993: 139-149
- 1992
- [j7]Erich Grädel: Capturing Complexity Classes by Fragments of Second-Order Logic. Theor. Comput. Sci. 101(1): 35-57 (1992)
- [c11]Thomas Behrendt, Kevin J. Compton, Erich Grädel: Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. CSL 1992: 43-60
- [c10]Erich Grädel, Martin Otto: Inductive Definability with Counting on Finite Structures. CSL 1992: 231-247
- [c9]Erich Grädel, Gregory L. McColm: Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. FOCS 1992: 167-176
- [c8]Erich Grädel, Gregory L. McColm: Deterministic vs. Nondeterministic Transitive Closure Logic. LICS 1992: 58-63
- 1991
- [j6]
- [c7]Erich Grädel: Capturing Complexity Classes by Fragments of Second Order Logic. Structure in Complexity Theory Conference 1991: 341-352
- [c6]
- [c5]
- 1990
- [j5]Erich Grädel: On the Notion of Linear Time Computability. Int. J. Found. Comput. Sci. 1(3): 295-308 (1990)
- [j4]Erich Grädel: Simple Interpretations Among Complicated Theories. Inf. Process. Lett. 35(5): 235-238 (1990)
- [j3]
1980 – 1989
- 1989
- [j2]Erich Grädel: Dominoes and the Complexity of Subclasses of Logical Theories. Ann. Pure Appl. Logic 43(1): 1-30 (1989)
- [c4]Erich Grädel: On Logical Descriptions of Some Concepts in Structural Complexity Theory. CSL 1989: 163-175
- [c3]
- 1988
- [j1]Erich Grädel: Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy. Theor. Comput. Sci. 56: 289-301 (1988)
- [c2]Erich Grädel: Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. CSL 1988: 118-137
- [c1]Erich Grädel: Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations. STACS 1988: 98-107
- 1987
- [b1]Erich Grädel: The complexity of subclasses of logical theories. Univ. Basel 1987, pp. 1-67
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19 22:00 CEST by the dblp team