- 25 May 2006 Newton Institute, Cambridge England A physical analysis of
- VAIO LX Series Developers' Stories After four years in development, the ultimate family PC becomes a reality.
- Generalized Implicit De nitions on Finite Stephane Grumbach?1 and Zoe Lacroix??2 and Steven Lindell???3
- REAL-TIME COLLABORATION TOOLS FOR DIGITAL INK * Steven Lindell
- History of logic Steven Lindell
- Computer Science as a Liberal Art
- A physical analysis of mechanical computability
- Finite model theory studies the expressive power of logical languages over collections of finite structures. Over the past few decades, deep connections
- Linear-time algorithms for Monadic Logic Steven Lindell
- Historical models of computation Steven Lindell
- ISLA 20101/23/2010 1 A normal form for first-order logic
- Inductive Classes of Finite Models Steven Lindell
- Monadic Counting Does Not Suffice Steven Lindell, Haverford College 6/21/95 revised 7/02
- Exponentiation is elementarily definable from addition and multiplication on finite structures Steven Lindell
- The Role of Decidability in First Order Separations over Classes of Finite Steven Lindell
- A Sequential Model of Computation for First-Order Logic Steven Lindell
- Book review of Descriptive Complexity by Neil Immerman (Graduate texts in Computer Science, Springer, 1999). Appeared in the Bulletin of Symbolic Logic vol. 7 no. 4 December, 2001 pages 525-527.
- Logic and Databases workshop Feb. 28, 2006 1
- Revisiting finite-visit computations Abstract: Incorporating matter and energy requirements
- A Logspace Algorithm for Tree Canonization (Extended Abstract)
- REAL-TIME COLLABORATION TOOLS FOR DIGITAL INK
- Computing Monadic Fixed-Points in Linear-Time on Doubly-Linked
- 6/25/2003 1 Linear-time algorithms
- A Constant-Space Model of Computation for First-Order Queries
- Logical definability over finite models
- Computing without Machines: A logical approach to the complexity
- International Journal of Foundations of Computer Science Vol. 19, No. i (2008) 205-217 V | W o r l d
- Computing monadic fixed-points in linear-time on doubly-linked data structures Steven Lindell
- A Term Logic for Physically Realizable Models of Information Steven Lindell
- Binary Tree Isomorphism Given two binary trees, are they isomorphic as
