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="Coppersmith, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linearity testing in characteristic two
M. Bellare
,
D. Coppersmith
,
J. HÃ¥stad
,
M. Kiwi
,
M. Sudan
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 432-441
Random walks on weighted graphs, and applications to on-line algorithms
D. Coppersmith
,
P. Doyle
,
P. Raghavan
,
M. Snir
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 369-378
Distribution of the minimum channel width in VLSI wiring
D. Coppersmith
,
I. Gopal
,
C.K. Wong
SIAM Journal on Algebraic Discrete Methods
8
, 1987, pp. 285-290
Parallel graph algorithms that are efficient on average
D. Coppersmith
,
R. Raghavan
,
M. Tompa
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 260-269
Matrix multiplication via arithmetic progressions
D. Coppersmith
,
S. Winograd
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 1-6
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
An application of factoring
D. Coppersmith
,
J.H. Davenport
Journal Symbolic Computation
1
(2), 1985, pp. 241-243
Evaluating logarithms in
GF(2^n)
D. Coppersmith
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 201-207
Analysis of a general mass storage system
D. Coppersmith
,
D.S. Parker
,
C.K. Wong
SIAM Journal on Computing
11
(1), 1982, February, pp. 94-116
Solving
NP
-hard problems on 'almost trees'; Vertex Cover
D. Coppersmith
,
U. Vishkin
Technical Report (RC 9405), 1982
On the asymptotic complexity of matrix multiplication
D. Coppersmith
,
S. Winograd
SIAM Journal on Computing
11
(3), 1982, August, pp. 472-492
Rapid multiplication of rectangular matrices
D. Coppersmith
SIAM Journal on Computing
11
(3), 1982, August, pp. 467-471
On the asymptotic complexity of matrix multiplication (extended summary)
D. Coppersmith
,
S. Winograd
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 82-90
The complement of certain recursively defined sets
D. Coppersmith
Journal of Combinatorial Theory Series A
18
, 1975, pp. 243-251
A combinatorial problem related to multimodule memory organizations
C.K. Wong
,
D. Coppersmith
Journal of the ACM
21
, 1974, pp. 392-402