Steven Lindell

According to our database1, Steven Lindell authored at least 14 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Traversal-invariant characterizations of logarithmic space.
CoRR, 2020

2015
Infinitary Methods in Finite Model Theory.
Proceedings of the Logic Without Borders, 2015

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

2007
Book Review.
J. Log. Lang. Inf., 2007

2000
The Role of Decidability in First Order Separations over Classes of Finite Structures.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1998
Elementary Properties of the Finite Ranks.
Math. Log. Q., 1998

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

1995
Infinitary Logic and Inductive Definability over Finite Structures
Inf. Comput., June, 1995

Generalized Implicit Definitions on Finite Structures.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

First Order Logic, Fixed Point Logic and Linear Order.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

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

A Logspace Algorithm for Tree Canonization (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Purely Logical Characterization of Circuit Uniformity.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

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


  Loading...