ask others

David Lichtenstein

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1991
[j5]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/algorithmica/AggarwalKLLW91
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/algorithmica/AggarwalKLLW91
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)

1980 – 1989

see FAQ

What is the meaning of the colors in the publication lists?

1989
[j4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/combinatorica/LichtensteinLS89
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/combinatorica/LichtensteinLS89
David Lichtenstein, Nathan Linial, Michael E. Saks:
Some extremal problems arising form discrete control processes. Combinatorica 9(3): 269-287 (1989)
1987
[c5]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/LichtensteinLS87
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/LichtensteinLS87
David Lichtenstein, Nathan Linial, Michael E. Saks:
Imperfect Random Sources and Discrete Controlled Processes. STOC 1987: 169-177
1985
[c4]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/AggarwalKLLW85
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/AggarwalKLLW85
Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson:
Multi-Layer Grid Embeddings. FOCS 1985: 186-196
1982
[j3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamcomp/Lichtenstein82
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamcomp/Lichtenstein82
David Lichtenstein:
Planar Formulae and Their Uses. SIAM J. Comput. 11(2): 329-343 (1982)
1981
[j2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jct/FraenkelL81
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jct/FraenkelL81
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)
[c3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/FraenkelL81
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/FraenkelL81
Aviezri S. Fraenkel, David Lichtenstein:
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP 1981: 278-293
1980
[j1]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - journals/jacm/LichtensteinS80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jacm/LichtensteinS80
David Lichtenstein, Michael Sipser:
GO Is Polynomial-Space Hard. J. ACM 27(2): 393-401 (1980)
[c2]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/Lichtenstein80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/Lichtenstein80
David Lichtenstein:
Isomorphism for Graphs Embeddable on the Projective Plane. STOC 1980: 218-224

1970 – 1979

see FAQ

What is the meaning of the colors in the publication lists?

1978
[c1]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/LichtensteinS78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/LichtensteinS78
David Lichtenstein, Michael Sipser:
GO Is PSPACE Hard. FOCS 1978: 48-54

Coauthor Index

see FAQ

maintained by

at