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="Klawe, M.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Alphabetic minimax trees of degree at most
t
D. Coppersmith
,
M.M. Klawe
,
N.J. Pippenger
SIAM Journal on Computing
15
(1), 1986, February, pp. 189-192
Improved lower bounds for the cycle detection problem
E. Allender
,
M.M. Klawe
Theoretical Computer Science
36
(2,3), 1985, pp. 231-237
Bounded-depth, polynomial-size circuits for symmetric functions
R. Fagin
,
M.M. Klawe
,
N.J. Pippenger
,
L. Stockmeyer
Theoretical Computer Science
36
(2,3), 1985, pp. 239-250
Alphabetic minimax trees
D.G. Kirkpatrick
,
M.M. Klawe
SIAM Journal on Computing
14
(3), 1985, August, pp. 514-526
A tight bound for black and white pebbles on the pyramid
M.M. Klawe
Journal of the ACM
32
(1), 1985, pp. 218-228
Bounding fan-out in logical networks
H.J. Hoover
,
M.M. Klawe
,
N.J. Pippenger
Journal of the ACM
31
(1), 1984, pp. 13-18
On pseudosimilarity in trees
D.G. Kirkpatrick
,
M.M. Klawe
,
D.G. Corneil
Journal of Combinatorial Theory Series B
34
(3), 1983, June, pp. 323-339
A tight bound for black and white pebbles on the pyramid
M.M. Klawe
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 410-419
Isomorphism testing in hookup classes
M.M. Klawe
,
D.G. Corneil
,
A. Proskurowski
SIAM Journal on Algebraic Discrete Methods
3
, 1982, pp. 260-274