David Lichtenstein

Imperfect random sources and discrete controlled processes

Michael E. Saks, Nathan Linial, David Lichtenstein, 1987, STOC.

Isomorphism for graphs embeddable on the projective plane

David Lichtenstein, David Lichtenstein, 1980, STOC '80.

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N

Aviezri S. Fraenkel, David Lichtenstein, A. Fraenkel, 1981, ICALP.

Planar Formulae and Their Uses

David Lichtenstein, David Lichtenstein, 1982, SIAM J. Comput..

Multi-layer grid embeddings

Alok Aggarwal, Avi Wigderson, Nathan Linial, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

GO Is Polynomial-Space Hard

David Lichtenstein, Michael Sipser, M. Sipser, 1980, JACM.

Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n

Aviezri S. Fraenkel, David Lichtenstein, A. Fraenkel, 1981, J. Comb. Theory, Ser. A.

A lower bound on the area of permutation layouts

Alok Aggarwal, Avi Wigderson, Nathan Linial, 1991, Algorithmica.

GO is pspace hard

David Lichtenstein, Michael Sipser, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

Some extremal problems arising from discrete control processes

Michael E. Saks, Nathan Linial, David Lichtenstein, 1989, Comb..