David Lichtenstein

Publications

1.2K

Citations

H-Index

1978

Active since

Affiliations

University of California, Berkeley(Current)

Hebrew University of Jerusalem

IBM (United States)

David Lichtenstein is an author at University of California, Berkeley specializing in computational complexity, engineering, and combinatorial optimization.

Top concepts

EngineeringComputational ComplexityComputer ScienceCombinatorial OptimizationGamesBusinessGame TheoryMechanism DesignDiscrete MathematicsAlgorithmic Game Theory

Publications per year

1978–1991

Publications

Planar Formulae and Their Uses

David Lichtenstein · SIAM Journal on Computing · 1982 · 748 citations

Geometric Modeling, Circuit Complexity, Engineering +15

Computing a perfect strategy for n × n chess requires time exponential in n

Aviezri S. Fraenkel, David Lichtenstein · Journal of Combinatorial Theory Series A · 1981 · 182 citations

Simultaneous Game, Engineering, Exponential Algorithm +10

GO Is Polynomial-Space Hard

David Lichtenstein, Michael Sipser · Journal of the ACM · 1980 · 182 citations · Full text

Game Ai, Computational Complexity Theory, Engineering +19

Some extremal problems arising from discrete control processes

David Lichtenstein, Nathan Linial, Michael Saks · COMBINATORICA · 1989 · 45 citations

Mathematical Programming, Discrete Dynamical System, Mathematical Control Theory +2

GO is pspace hard

David Lichtenstein, Michael Sipser · 1978 · 31 citations

Mathematical Programming, Certain Combinatorial Games, Simultaneous Game +15

Rows per page

1–5 of 7