David Lichtenstein

According to our database, David Lichtenstein authored at least 10 papers between 1978 and 1991.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1991

A Lower Bound on the Area of Permutation Layouts.

Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson

Algorithmica, 1991

1989

Some extremal problems arising form discrete control processes.

David Lichtenstein, Nathan Linial, Michael E. Saks

Comb., 1989

1987

Imperfect Random Sources and Discrete Controlled Processes

David Lichtenstein, Nathan Linial, Michael E. Saks

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985

Multi-Layer Grid Embeddings

Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1982

Planar Formulae and Their Uses.

David Lichtenstein

SIAM J. Comput., 1982

1981

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

Aviezri S. Fraenkel, David Lichtenstein

J. Comb. Theory, Ser. A, 1981

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

Aviezri S. Fraenkel, David Lichtenstein

Proceedings of the Automata, 1981

1980

GO Is Polynomial-Space Hard.

David Lichtenstein, Michael Sipser

J. ACM, 1980

Isomorphism for Graphs Embeddable on the Projective Plane

David Lichtenstein

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978

GO Is PSPACE Hard

David Lichtenstein, Michael Sipser

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978