Erich Grädel

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

Coauthor Index

1	Samson Abramsky	[77]
2	Thomas Behrendt	[18]
3	Dietmar Berwanger	[54] [60] [63] [66] [70] [78]
4	Achim Blumensath	[50] [67]
5	Egon Börger	[34]
6	Kevin J. Compton	[18] [22] [29]
7	Anuj Dawar	[28] [55] [68] [71] [73] [82] [87] [89]
8	Diana Fischer	[79] [80] [86]
9	Jörg Flum	[83]
10	M.-Elisabeth Goncalves	[52]
11	Georg Gottlob	[59]
12	Yuri Gurevich	[23] [24] [25] [34] [35] [36]
13	Joseph Y. Halpern	[62]
14	Colin Hirsch	[36] [51] [58]
15	Bjarki Holm	[89]
16	Radha Jagadeesan	[62]
17	Reinhard Kahle	[85]
18	Lukasz Kaiser	[79] [80] [84] [86] [90]
19	Phokion G. Kolaitis	[31]
20	Eryk Kopczynski	[89]
21	Stephan Kreutzer	[47] [55] [63] [64] [68] [71] [73]
22	Giacomo Lenzi	[60] [78]
23	Johann A. Makowsky (Janos Makowsky)	[72] [77]
24	Anders Malmström	[20] [43]
25	Gregory L. McColm	[16] [17] [26] [30]
26	Klaus Meer	[27]
27	Antje Nowack	[65]
28	Martin Otto	[19] [32] [33] [38] [42] [51] [58]
29	Wied Pakusa	[89]
30	Adolfo Piperno	[62]
31	Roman Rabinovich	[84]
32	Alexander A. Razborov	[72]
33	Eric Rosen	[32] [33] [39] [42] [46]
34	Marc Spielmann	[44]
35	Wolfgang Thomas	[61]
36	Moshe Y. Vardi	[31]
37	Helmut Veith	[59]
38	Igor Walukiewicz	[45] [74] [75] [76]
39	Thomas Wilke	[61] [83]
40	Faried Abu Zaid	[90]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page