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="Klawe, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounds on the convex label number of trees
M. Bern
,
M. Klawe
,
A. Wong
Combinatorica
7
(3), 1987, pp. 221-230
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
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
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 monotone formulae with restricted depth
M. Klawe
,
W. Paul
,
N. Pippenger
,
M. Yannakakis
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 480-487
Limitations on explicit constructions of expanding graphs
M. Klawe
SIAM Journal on Computing
13
(1), 1984, February, pp. 156-166
Bounded depth, polynomial-size circuits for symmetric functions
R. Fagin
,
M. Klawe
,
N. Pippenger
,
L. Stockmeyer
Technical Report (RJ 4040), 1983
Traditional galleries require fewer watchmen
J. Kahn
,
M. Klawe
,
D. Kleitman
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 194-206
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
An
O(n\log n)
unidirectional distributed algorithm for extrema finding in a circle
D. Dolev
,
M. Klawe
,
M. Rodeh
Journal of Algorithms
3
(3), 1982, September, pp. 245-260
Isomorphism testing in hookup classes
M.M. Klawe
,
D.G. Corneil
,
A. Proskurowski
SIAM Journal on Algebraic Discrete Methods
3
, 1982, pp. 260-274
Limitations on explicit constructions of expanding graphs
M. Klawe
Technical Report (RJ 3544), 1982
Non-existence of one-dimensional expanding graphs
M. Klawe
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 109-114