David Lichtenstein

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1991
A Lower Bound on the Area of Permutation Layouts.
Algorithmica, 1991

1989
Some extremal problems arising form discrete control processes.
Comb., 1989

1987
Imperfect Random Sources and Discrete Controlled Processes
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985
Multi-Layer Grid Embeddings
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1982
Planar Formulae and Their Uses.
SIAM J. Comput., 1982

1981
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n.
J. Comb. Theory A, 1981

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N.
Proceedings of the Automata, 1981

1980
GO Is Polynomial-Space Hard.
J. ACM, 1980

Isomorphism for Graphs Embeddable on the Projective Plane
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978
GO Is PSPACE Hard
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978


  Loading...