Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lichtenstein, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some extremal problems arising from discrete control processes
D. Lichtenstein
,
N. Linial
,
M. Saks
Combinatorica
9
(3), 1989, pp. 269-287
Imperfect random sources and discrete controlled processes
D. Lichtenstein
,
N. Linial
,
M. Saks
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 169-177
Multilayer grid embeddings
A. Aggarwal
,
M. Klawe
,
D. Lichtenstein
,
N. Linial
,
A. Wigderson
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 186-196
Planar formulae and their uses
D. Lichtenstein
SIAM Journal on Computing
11
(2), 1982, May, pp. 329-343
GO is polynomial-space hard
D. Lichtenstein
,
M. Sipser
Journal of the ACM
27
(2), 1980, pp. 393-401
Isomorphism for graphs embeddable on the projective plane
D. Lichtenstein
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 218-224
GO is pspace hard
D. Lichtenstein
,
M. Sipser
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 48-54