An Analysis of Fixed-Point Queries on Binary Trees. - Steven Lindell (Theor. Comput. Sci., 1991)

A Purely Logical Characterization of Circuit Uniformity. - Steven Lindell (SCT, 1992)

A Logspace Algorithm for Tree Canonization (Extended Abstract) - Steven Lindell (STOC, 1992)

The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries. - Steven Lindell (J. Comput. Syst. Sci., 1992)

First Order Logic, Fixed Point Logic and Linear Order. - Anuj Dawar; Steven Lindell; Scott Weinstein (CSL, 1995)

Generalized Implicit Definitions on Finite Structures. - Stéphane Grumbach; Zoé Lacroix; Steven Lindell (CSL, 1995)

Infinitary Logic and Inductive Definability over Finite Structures - Anuj Dawar; Steven Lindell; Scott Weinstein (Inf. Comput., 1995)

A Constant-Space Sequential Model of Computation for First-Order Logic. - Steven Lindell (Inf. Comput., 1998)

Elementary Properties of the Finite Ranks. - Anuj Dawar; Kees Doets; Steven Lindell; Scott Weinstein (Math. Log. Q., 1998)

The Role of Decidability in First Order Separations over Classes of Finite Structures. - Steven Lindell; Scott Weinstein (LICS, 2000)

Book Review. - Steven Lindell; Scott Weinstein (J. Log. Lang. Inf., 2007)

A Normal Form for First-Order Logic over Doubly-Linked Data Structures. - Steven Lindell (Int. J. Found. Comput. Sci., 2008)

Real-time collaboration tools for digital ink. - Steven Lindell (J. Comput. Sci. Coll., 2010)

Infinitary Methods in Finite Model Theory. - Steven Lindell; Henry Towsner; Scott Weinstein (Logic Without Borders, 2015)

Traversal-Invariant Characterizations of Logarithmic Space. - Siddharth Bhaskar; Steven Lindell; Scott Weinstein (Tannen's Festschrift, 2024)