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="Cook, Stephen A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An exponential lower bound for the size of monotone real circuits
Armin Haken
,
Stephen A. Cook
Journal of Computer and System Sciences
58
(2), 1999, pp. 326-335
A new characterization of Mehlhorn's polynomial time functionals
Bruce Kapron
,
Stephen A. Cook
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 342-347
Two applications of inductive counting for complementation problems
Allan Borodin
,
Stephen A. Cook
,
Patrick W. Dymond
,
Walter L. Ruzzo
,
Martin Tompa
SIAM Journal on Computing
18
, 1989, pp. 559-578
Complexity theory of parallel time and hardware
Patrick W. Dymond
,
Stephen A. Cook
Information and Computation
80
(3), 1989, pp. 205-226
Two applications of complementation via inductive counting
Allan Borodin
,
Stephen A. Cook
,
Patrick W. Dymond
,
Walter L. Ruzzo
,
Martin Tompa
Technical Report (87-10-01), 1987, October
Two applications of complementation via inductive counting
Allan Borodin
,
Stephen A. Cook
,
Patrick W. Dymond
,
Walter L. Ruzzo
,
Martin Tompa
Technical Report (RC 13179), 1987, October
Problems complete for deterministic logarithmic space
Stephen A. Cook
,
Pierre McKenzie
Journal of Algorithms
8
(3), 1987, September, pp. 385-394
A hierarchy for nondeterministic time complexity
Stephen A. Cook
Journal of Computer and System Sciences
7
, 1973, pp. 343-353
Characterizations of pushdown machines in terms of time-bounded computers
Stephen A. Cook
Journal of the ACM
18
, 1971, pp. 4-18
The solvability of the derivability problem for one-normal systems
Stephen A. Cook
Journal of the ACM
13
, 1966, pp. 223-225