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