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="Bini, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bernstein-Bezoutian matrices
D.A. Bini
,
L. Gemignani
Theoretical Computer Science
315
(2-3), 2004, pp. 319-333
Improved parallel computations with matrices and polynomials
D. Bini
,
L. Gemignani
,
V. Pan
Lecture Notes in Computer Science
510
, 1991, pp. 520-531
A new preconditioner for the parallel solution of positive definite Toeplitz systems
D. Bini
,
F. Benedetto
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 220-223
On the Euclidean scheme for polynomials having interlaced real zeros
D. Bini
,
L. Gemignani
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 254-258
Tensor rank and border rank of band Toeplitz matrices
D. Bini
,
M. Capovani
SIAM Journal on Computing
16
(2), 1987, April, pp. 252-258
A logarithmic Boolean time algorithm for parallel polynomial division
D. Bini
,
V.Y. Pan
Information Processing Letters
24
(4), 1987, March, pp. 233-237
A logarithmic boolean time algorithm for parallel polynomial division
D. Bini
,
V. Pan
Lecture Notes in Computer Science
227
, 1986, pp. 246-251
Parallel Polynomial Division Can Be Accelerated Preserving Full Efficiency of the Best Sequential Algorithms
D. Bini
,
V. Pan
Technical Report (85-3), 1985
Algorithms for polynomial division
D. Bini
,
V. Pan
Lecture Notes in Computer Science
204
, 1985, pp. 1-3
Fast parallel polynominal division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
D. Bini
,
V.Ya. Pan
Information Processing Letters
21
(2), 1985, August, pp. 79-81
Parallel solution of certain Toeplitz linear systems
D. Bini
SIAM Journal on Computing
13
(2), 1984, May, pp. 268-276
On commutativity and approximation
D. Bini
Theoretical Computer Science
28
(1,2), 1984, pp. 135-150
Approximate solutions for the bilinear form computational problem
D. Bini
,
G. Lotti
,
F. Romani
SIAM Journal on Computing
9
(4), 1980, November, pp. 692-697
Border rank of a
p\times q\times 2
tensor and the optimal approximation of a pair of bilinear forms
D. Bini
Lecture Notes in Computer Science
85
, 1980, pp. 98-108
On
(n^{2.7799})
complexity for
n*n
approximate matrix multiplication
D. Bini
,
M. Capovani
,
F. Romani
,
G. Lotti
Information Processing Letters
8
(5), 1979, June, pp. 234-235
Lower bounds of the complexity of linear algebras
D. Bini
,
M. Capovani
Information Processing Letters
9
(1), 1979, July, pp. 46-47