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
[1]
Hilfe
Suche: Author="Stockmeyer, Larry J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of PDL with interleaving
Alain J. Mayer
,
Larry J. Stockmeyer
Theoretical Computer Science
161
(1-2), 1996, pp. 109-122
On monadic
NP
vs monadic
coNP
Ronald Fagin
,
Larry J. Stockmeyer
,
Moshe Y. Vardi
Information and Computation
120
(1), 1995, pp. 78-92
The complexity of word problems-this time with interleaving
Alan J. Mayer
,
Larry J. Stockmeyer
Information and Computation
115
(2), 1994, December, pp. 293-311
Computational complexity
Larry J. Stockmeyer
Handbooks in Operations Research and Management Science
3
, 1992, pp. 455-517
Simulation of parallel random access machines by circuits
Larry J. Stockmeyer
,
Uzi Vishkin
SIAM Journal on Computing
13
(2), 1984, May, pp. 409-422
The polynomial-time hierarchy
Larry J. Stockmeyer
Theoretical Computer Science
3
(1), 1976, pp. 1-22
On the combinational complexity of certain symmetric Boolean functions
Larry J. Stockmeyer
Math. Systems Theory
10
, 1976/77, pp. 323-336
Fast on-line integer multiplication
Michael J. Fischer
,
Larry J. Stockmeyer
Journal of Computer and System Sciences
9
, 1974, pp. 317-331