GO Is PSPACE Hard - David Lichtenstein; Michael Sipser (FOCS, 1978)

Isomorphism for Graphs Embeddable on the Projective Plane - David Lichtenstein (STOC, 1980)

GO Is Polynomial-Space Hard. - David Lichtenstein; Michael Sipser (J. ACM, 1980)

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. - Aviezri S. Fraenkel; David Lichtenstein (ICALP, 1981)

Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. - Aviezri S. Fraenkel; David Lichtenstein (J. Comb. Theory A, 1981)

Planar Formulae and Their Uses. - David Lichtenstein (SIAM J. Comput., 1982)

Multi-Layer Grid Embeddings - Alok Aggarwal; Maria M. Klawe; David Lichtenstein; Nathan Linial; Avi Wigderson (FOCS, 1985)

Imperfect Random Sources and Discrete Controlled Processes - David Lichtenstein; Nathan Linial; Michael E. Saks (STOC, 1987)

Some extremal problems arising form discrete control processes. - David Lichtenstein; Nathan Linial; Michael E. Saks (Comb., 1989)

A Lower Bound on the Area of Permutation Layouts. - Alok Aggarwal; Maria M. Klawe; David Lichtenstein; Nathan Linial; Avi Wigderson (Algorithmica, 1991)