| 2008 |
|---|
| 13 | EE | Steven Lindell:
A Normal Form for First-Order Logic over Doubly-Linked Data Structures.
Int. J. Found. Comput. Sci. 19(1): 205-217 (2008) |
| 2007 |
|---|
| 12 | EE | Steven Lindell,
Scott Weinstein:
Book Review.
Journal of Logic, Language and Information 16(2): 233-239 (2007) |
| 2000 |
|---|
| 11 | EE | Steven Lindell,
Scott Weinstein:
The Role of Decidability in First Order Separations over Classes of Finite Structures.
LICS 2000: 45-50 |
| 1998 |
|---|
| 10 | | Steven Lindell:
A Constant-Space Sequential Model of Computation for First-Order Logic.
Inf. Comput. 143(2): 231-250 (1998) |
| 9 | | Anuj Dawar,
Kees Doets,
Steven Lindell,
Scott Weinstein:
Elementary Properties of the Finite Ranks.
Math. Log. Q. 44: 349-353 (1998) |
| 1995 |
|---|
| 8 | | Anuj Dawar,
Steven Lindell,
Scott Weinstein:
First Order Logic, Fixed Point Logic and Linear Order.
CSL 1995: 161-177 |
| 7 | | Stéphane Grumbach,
Zoé Lacroix,
Steven Lindell:
Generalized Implicit Definitions on Finite Structures.
CSL 1995: 252-265 |
| 6 | | Anuj Dawar,
Steven Lindell,
Scott Weinstein:
Infinitary Logic and Inductive Definability over Finite Structures
Inf. Comput. 119(2): 160-175 (1995) |
| 1994 |
|---|
| 5 | | Steven Lindell:
A Constant-Space Sequential Model of Computation for First-Order Logic.
LCC 1994: 447-462 |
| 1992 |
|---|
| 4 | | Steven Lindell:
A Logspace Algorithm for Tree Canonization (Extended Abstract)
STOC 1992: 400-404 |
| 3 | | Steven Lindell:
A Purely Logical Characterization of Circuit Uniformity.
Structure in Complexity Theory Conference 1992: 185-192 |
| 2 | | Steven Lindell:
The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries.
J. Comput. Syst. Sci. 44(3): 385-410 (1992) |
| 1991 |
|---|
| 1 | | Steven Lindell:
An Analysis of Fixed-Point Queries on Binary Trees.
Theor. Comput. Sci. 85(1): 75-95 (1991) |
