BibSLEIGH — Erich

Travelled to:

1 × Canada
1 × Czech Republic
1 × Finland
1 × Israel
1 × Japan
1 × Poland
1 × Spain
1 × Switzerland
2 × United Kingdom
3 × France
3 × Germany
4 × Italy
5 × USA

Collaborated with:

∅ A.Dawar S.Kreutzer W.Pakusa M.Otto E.Rosen Y.Gurevich S.Leßenich C.Hirsch A.Blumensath M.Spielmann I.Walukiewicz K.Meer A.Malmström G.L.McColm S.Hegselmann M.Hoelzel M.O.0001 D.Berwanger G.Lenzi T.Behrendt K.J.Compton B.Pago F.A.Zaid F.Reinhardt F.Canavoi S.Schalthofer L.Kaiser B.Holm E.Kopczynski

Talks about:

logic (11) complex (7) descript (5) point (5) guard (5) fix (5) structur (4) defin (4) game (4) variabl (3)

Person: Erich Grädel

DBLP: Gr=auml=del:Erich

Facilitated 1 volumes:

Contributed to:

2015

2012

2010

2008

2004

2003

2002

2001

2000

1999

1998

1997

1995

1994

1993

1992

1991

1989

1988

2016

2017

2018

2020

Wrote 35 papers:

CSL-2015-GradelP #exclamation #logic #rank: Rank Logic is Dead, Long Live Rank Logic! (EG, WP), pp. 390–404.
LICS-2015-CanavoiGLP #fixpoint #logic: Defining Winning Strategies in Fixed-Point Logic (FC, EG, SL, WP), pp. 366–377.
LICS-2015-GradelPSK #first-order #polynomial: Characterising Choiceless Polynomial Time with First-Order Interpretations (EG, WP, SS, LK), pp. 677–688.
CSL-2012-DawarGHKP #equation #linear: Definability of linear equation systems over groups and rings (AD, EG, BH, EK, WP), pp. 213–227.
CSL-2012-GradelL #game studies: Banach-Mazur Games with Simple Winning Strategies (EG, SL), pp. 305–319.
CSL-2010-Gradel #game studies: Definability in Games (EG), pp. 19–21.
CSL-2008-DawarG #complexity #game studies: The Descriptive Complexity of Parity Games (AD, EG), pp. 354–368.
ICALP-2004-DawarGK #backtracking #fixpoint #game studies: Backtracking Games and Inflationary Fixed Points (AD, EG, SK), pp. 420–432.
LICS-2003-GradelK #fixpoint: Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions (EG, SK), p. 158–?.
CSL-2002-BerwangerGL #calculus #on the #μ-calculus: On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
CSL-2001-DawarGK #fixpoint #logic: Inflationary Fixed Points in Modal Logic (AD, EG, SK), pp. 277–291.
LICS-2000-BlumensathG #automation: Automatic Structures (AB, EG), pp. 51–62.
LICS-2000-GradelHO #logic: Back and Forth between Guarded and Modal Logics (EG, CH, MO), pp. 217–228.
CADE-1999-Gradel #logic: Invited Talk: Decision procedures for guarded logics (EG), pp. 31–51.
CSL-1999-GradelK #complexity #constraints #database: Descriptive Complexity Theory for Constraint Databases (EG, SK), pp. 67–81.
FM-v2-1999-GradelS #state machine: Logspace Reducibility via Abstract State Machines (EG, MS), pp. 1738–1757.
LICS-1999-GradelR: Two-Variable Descriptions of Regularity (EG, ER), pp. 14–23.
LICS-1999-GradelW #fixpoint #logic: Guarded Fixed Point Logic (EG, IW), pp. 45–54.
PODS-1998-GradelGH #complexity #query #reliability: The Complexity of Query Reliability (EG, YG, CH), pp. 227–234.
LICS-1997-GradelOR #decidability #logic: Two-Variable Logic with Counting is Decidable (EG, MO, ER), pp. 306–317.
LICS-1995-DawarG #quantifier: Generalized Quantifiers and 0-1 Laws (AD, EG), pp. 54–64.
STOC-1995-GradelM #complexity: Descriptive complexity theory over the real numbers (EG, KM), pp. 315–324.
ICALP-1994-GradelG #complexity: Tailoring Recursing for Complexity (EG, YG), pp. 118–129.
CSL-1993-GradelM #problem #random: Approximable Minimization Problems and Optimal Solutions on Random Inputs (EG, AM), pp. 139–149.
CSL-1992-BehrendtCG #approximate #optimisation #problem: Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions (TB, KJC, EG), pp. 43–60.
CSL-1992-GradelO #finite #induction: Inductive Definability with Counting on Finite Structures (EG, MO), pp. 231–247.
LICS-1992-GraedelM #logic #nondeterminism #transitive: Deterministic vs. Nondeterministic Transitive Closure Logic (EG, GLM), pp. 58–63.
CSL-1991-Gradel #logic #on the #transitive: On Transitive Closure Logic (EG), pp. 149–163.
CSL-1989-Gradel #complexity #concept #logic #on the: On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.
CSL-1988-Gradel #complexity #modelling #nondeterminism: Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes (EG), pp. 118–137.
CSL-2016-GradelH #semantics: Counting in Team Semantics (EG, SH), p. 18.
CSL-2017-GradelPP #proving: The Model-Theoretic Expressiveness of Propositional Proof Systems (EG, BP, WP), p. 18.
CSL-2017-ZaidGR #automation: Advice Automatic Structures and Uniformly Automatic Classes (FAZ, EG, FR), p. 20.
CSL-2018-GradelH #concept #dependence #equivalence: Dependency Concepts up to Equivalence (EG, MH), p. 21.
CSL-2020-Gradel0: Guarded Teams: The Horizontally Guarded Case (EG, MO0), p. 17.