SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Stephan Kreutzer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Erich Grädel, Stephan Kreutzer
Descriptive Complexity Theory for Constraint Databases. [Citation Graph (3, 0)][DBLP]
CSL, 1999, pp:67-81 [Conf]
Stephan Kreutzer
Fixed-Point Query Languages for Linear Constraint Databases. [Citation Graph (2, 14)][DBLP]
PODS, 2000, pp:116-125 [Conf]
Julian C. Bradfield, Stephan Kreutzer
The Complexity of Independence-Friendly Fixpoint Logic. [Citation Graph (0, 0)][DBLP]
CSL, 2005, pp:355-368 [Conf]
Anuj Dawar, Erich Grädel, Stephan Kreutzer
Inflationary Fixed Points in Modal Logic. [Citation Graph (0, 0)][DBLP]
CSL, 2001, pp:277-291 [Conf]
Stephan Kreutzer
Partial Fixed-Point Logic on Infinite Structures. [Citation Graph (0, 0)][DBLP]
CSL, 2002, pp:337-351 [Conf]
Anuj Dawar, Stephan Kreutzer
Generalising Automaticity to Modal Properties of Finite Structures. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2002, pp:109-120 [Conf]
Anuj Dawar, Erich Grädel, Stephan Kreutzer
Backtracking Games and Inflationary Fixed Points. [Citation Graph (0, 0)][DBLP]
ICALP, 2004, pp:420-432 [Conf]
Stephan Kreutzer
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. [Citation Graph (0, 9)][DBLP]
ICDT, 2001, pp:248-262 [Conf]
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
Approximation Schemes for First-Order Definable Optimisation Problems. [Citation Graph (0, 0)][DBLP]
LICS, 2006, pp:411-420 [Conf]
Erich Grädel, Stephan Kreutzer
Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:158-0 [Conf]
Stephan Kreutzer
Expressive Equivalence of Least and Inflationary Fixed-Point Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2002, pp:403-0 [Conf]
Dietmar Berwanger, Erich Grädel, Stephan Kreutzer
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. [Citation Graph (0, 0)][DBLP]
LPAR, 2003, pp:229-243 [Conf]
Stephan Kreutzer
Operational Semantics for Fixed-Point Logics on Constraint Databases. [Citation Graph (0, 0)][DBLP]
LPAR, 2001, pp:470-484 [Conf]
Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
The Expressive Power of Two-Variable Least Fixed-Point Logics. [Citation Graph (0, 0)][DBLP]
MFCS, 2005, pp:422-434 [Conf]
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
DAG-Width and Parity Games. [Citation Graph (0, 0)][DBLP]
STACS, 2006, pp:524-536 [Conf]
Stephan Kreutzer
Expressive equivalence of least and inflationary fixed-point logic. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 2004, v:130, n:1-3, pp:61-78 [Journal]
Stephan Kreutzer, Nicole Schweikardt
Logik und Informatik. [Citation Graph (0, 0)][DBLP]
it - Information Technology, 2004, v:46, n:3, pp:162-166 [Journal]
Achim Bluemnsath, Stephan Kreutzer
An Extension of Muchnik's Theorem. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2005, v:15, n:1, pp:59-74 [Journal]
Anuj Dawar, Erich Grädel, Stephan Kreutzer
Backtracking games and inflationary fixed points. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:350, n:2-3, pp:174-187 [Journal]
Anuj Dawar, Erich Grädel, Stephan Kreutzer
Inflationary fixed points in modal logic. [Citation Graph (0, 0)][DBLP]
ACM Trans. Comput. Log., 2004, v:5, n:2, pp:282-315 [Journal]
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
Boundedness of Monadic FO over Acyclic Structures. [Citation Graph (0, 0)][DBLP]
ICALP, 2007, pp:571-582 [Conf]
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
Model Theory Makes Formulas Large. [Citation Graph (0, 0)][DBLP]
ICALP, 2007, pp:913-924 [Conf]
Anuj Dawar, Martin Grohe, Stephan Kreutzer
Locally Excluding a Minor. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:270-279 [Conf]
Paul Hunter, Stephan Kreutzer
Digraph measures: Kelly decompositions, games, and orderings. [Citation Graph (0, 0)][DBLP]
SODA, 2007, pp:637-644 [Conf]
Anuj Dawar, Stephan Kreutzer
Generalising automaticity to modal properties of finite structures. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:379, n:1-2, pp:266-285 [Journal]
Linkless and flat embeddings in 3-space and the unknot problem. [Citation Graph (, )][DBLP]
Reachability in Succinct and Parametric One-Counter Automata. [Citation Graph (, )][DBLP]
On the Parameterised Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
Domination Problems in Nowhere-Dense Classes. [Citation Graph (, )][DBLP]
On Datalog vs. LFP. [Citation Graph (, )][DBLP]
Algorithmic Meta-theorems. [Citation Graph (, )][DBLP]
Lower Bounds for the Complexity of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
Computing excluded minors. [Citation Graph (, )][DBLP]
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
Digraph Decompositions and Monotonicity in Digraph Searching. [Citation Graph (, )][DBLP]
Distance d-Domination Games. [Citation Graph (, )][DBLP]
Digraph Decompositions and Monotonicity in Digraph Searching [Citation Graph (, )][DBLP]
Algorithmic Meta-Theorems [Citation Graph (, )][DBLP]
On the Parameterised Intractability of Monadic Second-Order Logic [Citation Graph (, )][DBLP]
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic [Citation Graph (, )][DBLP]
Domination Problems in Nowhere-Dense Classes of Graphs [Citation Graph (, )][DBLP]
Lower Bounds for the Complexity of Monadic Second-Order Logic [Citation Graph (, )][DBLP]
Extended Computation Tree Logic [Citation Graph (, )][DBLP]

Search in 0.007secs, Finished in 0.010secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP