List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A lower bound on the area of permutation layouts Algorithmica | 1991-01-01 | Paper |
| Some extremal problems arising from discrete control processes Combinatorica | 1989-01-01 | Paper |
| Planar Formulae and Their Uses SIAM Journal on Computing | 1982-01-01 | Paper |
| Computing a perfect strategy for nxn chess requires time exponential in n Journal of Combinatorial Theory. Series A | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3723925 (Why is no real title available?) | 1981-01-01 | Paper |
| GO Is Polynomial-Space Hard Journal of the ACM | 1980-01-01 | Paper |
Research outcomes over time
This page was built for person: David Lichtenstein
