2008 |
40 | | Dario Bini,
Beatrice Meini,
Vaidyanathan Ramaswami,
Marie-Ange Remiche,
Peter G. Taylor:
Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
39 | EE | Dario Andrea Bini,
Victor Y. Pan,
Jan Verschelde:
Preface.
Theor. Comput. Sci. 409(2): 155-157 (2008) |
2007 |
38 | EE | Dario Andrea Bini,
Paola Boito:
Structured matrix-based methods for polynomial in-gcd: analysis and comparisons.
ISSAC 2007: 9-16 |
37 | EE | Dario Andrea Bini,
Beatrice Meini,
Vaidyanathan Ramaswami,
Marie-Ange Remiche,
Peter G. Taylor:
07461 Abstracts Collection -- Numerical Methods for Structured Markov Chains.
Numerical Methods for Structured Markov Chains 2007 |
36 | EE | Dario Andrea Bini,
Beatrice Meini,
Vaidyanathan Ramaswami,
Marie-Ange Remiche,
Peter G. Taylor:
07461 Executive Summary -- Numerical Methods for Structured Markov Chains.
Numerical Methods for Structured Markov Chains 2007 |
35 | EE | Dario Andrea Bini,
Beatrice Meini,
Federico Poloni:
From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms.
Numerical Methods for Structured Markov Chains 2007 |
34 | EE | Dario Andrea Bini,
Bruno Iannazzo,
Beatrice Meini,
Federico Poloni:
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms.
Numerical Methods for Structured Markov Chains 2007 |
33 | EE | Dario Andrea Bini,
Beatrice Meini,
Vaidyanathan Ramaswami:
On the tail decay of M/G/1-type Markov renewal processes.
Numerical Methods for Structured Markov Chains 2007 |
2006 |
32 | EE | Dario Andrea Bini,
Ana Marco:
Computing curve intersection by means of simultaneous iterations.
Numerical Algorithms 43(2): 151-175 (2006) |
2004 |
31 | EE | Dario Bini,
Luca Gemignani:
Bernstein-Bezoutian matrices.
Theor. Comput. Sci. 315(2-3): 319-333 (2004) |
2001 |
30 | | Dario Bini,
Gianna M. Del Corso,
Giovanni Manzini,
Luciano Margara:
Inversion of circulant matrices over Zm.
Math. Comput. 70(235): 1169-1182 (2001) |
1999 |
29 | | Dario Bini,
Beatrice Meini:
Solving Block Banded Block Toeplitz Systems with Structured Blocks: New Algorithms and Open Problems.
LSSC 1999: 15-24 |
1998 |
28 | EE | Dario Bini,
Gianna M. Del Corso,
Giovanni Manzini,
Luciano Margara:
Inversion of Circulant Matrices over Zm.
ICALP 1998: 719-730 |
27 | EE | Dario Bini,
Victor Y. Pan:
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real.
SIAM J. Comput. 27(4): 1099-1115 (1998) |
1996 |
26 | EE | Dario Bini,
Victor Y. Pan:
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors.
J. Complexity 12(4): 492-511 (1996) |
25 | | Dario Bini,
Luca Gemignani:
Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices.
SIAM J. Comput. 25(6): 1358 (1996) |
1995 |
24 | | Dario Bini,
Luca Gemignani:
Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices.
SIAM J. Comput. 24(1): 63-77 (1995) |
1993 |
23 | EE | Dario Bini,
Victor Y. Pan:
Parallel Computations with Toeplitz-like and Hankel-like Matrices.
ISSAC 1993: 193-200 |
22 | | Dario Bini,
Victor Y. Pan:
Improved Parallel Polynomial Division.
SIAM J. Comput. 22(3): 617-626 (1993) |
1992 |
21 | | Dario Bini,
Victor Y. Pan:
Improved Parallel Polynomial Division and Its Extensions
FOCS 1992: 131-136 |
20 | | Dario Bini,
Luca Gemignani:
On the Complexity of Polynomial Zeros.
SIAM J. Comput. 21(4): 781-799 (1992) |
1991 |
19 | | Dario Bini,
Luca Gemignani,
Victor Y. Pan:
Improved Parallel Computations with Matrices and Polynomials.
ICALP 1991: 520-531 |
18 | | Dario Bini,
Victor Y. Pan:
Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem.
SODA 1991: 384-393 |
17 | EE | Dario Bini,
Victor Y. Pan:
On the evaluation of the Eigenvalues of a banded toeplitz block matrix.
J. Complexity 7(4): 408-424 (1991) |
1990 |
16 | EE | Dario Bini,
Victor Y. Pan:
Parallel Polynomial Computations by Recursive Processes.
ISSAC 1990: 294 |
15 | EE | Dario Bini,
Fabio Di Benedetto:
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems.
SPAA 1990: 220-223 |
14 | EE | Dario Bini,
Luca Gemignani:
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros.
SPAA 1990: 254-258 |
1987 |
13 | | Dario Bini,
Victor Y. Pan:
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.
Inf. Process. Lett. 24(4): 233-237 (1987) |
12 | | Dario Bini,
Milvio Capovani:
Tensor Rank and Border Rank of Band Toeplitz Matrices.
SIAM J. Comput. 16(2): 252-258 (1987) |
1986 |
11 | | Dario Bini,
Victor Y. Pan:
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.
Aegean Workshop on Computing 1986: 246-251 |
10 | EE | Dario Bini,
Victor Y. Pan:
Polynomial division and its computational complexity.
J. Complexity 2(3): 179-203 (1986) |
1985 |
9 | | Dario Bini,
Victor Y. Pan:
Algorithms for Polynominal Division.
European Conference on Computer Algebra (2) 1985: 1-3 |
8 | | Dario Bini,
Victor Y. Pan:
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power.
Inf. Process. Lett. 21(2): 79-81 (1985) |
1984 |
7 | | Dario Bini:
Parallel Solution of Certain Toeplitz Linear Systems.
SIAM J. Comput. 13(2): 268-276 (1984) |
6 | | Dario Bini:
On Commutativity and Approximation.
Theor. Comput. Sci. 28: 135-150 (1984) |
1982 |
5 | | Dario Bini:
Reply to the Paper "The Numerical Instability of Bini's Algorithm".
Inf. Process. Lett. 14(3): 144-145 (1982) |
1980 |
4 | | Dario Bini:
Border Rank of a pxqx2 Tensor and the Optimal Approximation od a Pair of Bilinear Forms.
ICALP 1980: 98-108 |
3 | | Dario Bini,
Grazia Lotti,
Francesco Romani:
Approximate Solutions for the Bilinear Form Computational Problem.
SIAM J. Comput. 9(4): 692-697 (1980) |
1979 |
2 | | Dario Bini,
Milvio Capovani,
Francesco Romani,
Grazia Lotti:
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication.
Inf. Process. Lett. 8(5): 234-235 (1979) |
1 | | Dario Bini,
Milvio Capovani:
Lower Bounds of the Complexity of Linear Algebras.
Inf. Process. Lett. 9(1): 46-47 (1979) |