Search the dblp DataBase

Publications of Author

1. David Lichtenstein
   Planar Formulae and Their Uses. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:329-343 [Journal]
   
2. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
   Multi-Layer Grid Embeddings [Citation Graph (0, 0)][DBLP]
   FOCS, 1985, pp:186-196 [Conf]
   
3. David Lichtenstein, Michael Sipser
   GO Is PSPACE Hard [Citation Graph (0, 0)][DBLP]
   FOCS, 1978, pp:48-54 [Conf]
   
4. Aviezri S. Fraenkel, David Lichtenstein
   Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. [Citation Graph (0, 0)][DBLP]
   ICALP, 1981, pp:278-293 [Conf]
   
5. David Lichtenstein
   Isomorphism for Graphs Embeddable on the Projective Plane [Citation Graph (0, 0)][DBLP]
   STOC, 1980, pp:218-224 [Conf]
   
6. David Lichtenstein, Nathan Linial, Michael E. Saks
   Imperfect Random Sources and Discrete Controlled Processes [Citation Graph (0, 0)][DBLP]
   STOC, 1987, pp:169-177 [Conf]
   
7. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
   A Lower Bound on the Area of Permutation Layouts. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1991, v:6, n:2, pp:241-255 [Journal]
   
8. David Lichtenstein, Nathan Linial, Michael E. Saks
   Some extremal problems arising form discrete control processes. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1989, v:9, n:3, pp:269-287 [Journal]
   
9. David Lichtenstein, Michael Sipser
   GO Is Polynomial-Space Hard. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1980, v:27, n:2, pp:393-401 [Journal]
   
10. Aviezri S. Fraenkel, David Lichtenstein
    Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:31, n:2, pp:199-214 [Journal]