Wayne Eberly

2007
24	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Faster inversion and other black box matrix computations using efficient block projections. ISSAC 2007: 143-150
23	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections CoRR abs/cs/0701188: (2007)
2006
22	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving sparse rational linear systems. ISSAC 2006: 63-70
21	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving Sparse Integer Linear Systems CoRR abs/cs/0603082: (2006)
2005
20	EE	Bradford Hovinen, Wayne Eberly: A reliable block Lanczos algorithm over small finite fields. ISSAC 2005: 177-184
2004
19	EE	Wayne Eberly: Reliable Krylov-based algorithms for matrix null space and rank. ISSAC 2004: 127-134
18	EE	Wayne Eberly, Mark Giesbrecht: Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004)
2003
17	EE	Wayne Eberly: Early termination over small fields. ISSAC 2003: 80-87
2000
16		Wayne Eberly, Mark Giesbrecht, Gilles Villard: Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685
15	EE	Wayne Eberly: Black box Frobenius decompositions over small fields. ISSAC 2000: 106-113
14		Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000)
1998
13	EE	Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca: Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC 1998: 149-160
1997
12		Wayne Eberly, Erich Kaltofen: On Randomized Lanczos Algorithms. ISSAC 1997: 176-183
1996
11	EE	Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras. ISSAC 1996: 170-178
1995
10		Wayne Eberly: Efficient Parallel Computations for Singular Band Matrices. SODA 1995: 132-138
9		Wayne Eberly: Fast Parallel Band Matrix Arithmetic Inf. Comput. 116(1): 117-127 (1995)
8		Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995)
1994
7		Wayne Eberly: Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms 16(3): 335-360 (1994)
1992
6		Wayne Eberly: On Efficient Band Matrix Arithmetic FOCS 1992: 457-463
1991
5		Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulae FOCS 1991: 334-341
4		Wayne Eberly: Decomposition of Algebras Over Finite Fields and Number Fields. Computational Complexity 1: 183-210 (1991)
3		Wayne Eberly: Decompositions of Algebras Over R and C. Computational Complexity 1: 211-234 (1991)
1989
2		Wayne Eberly: Very Fast Parallel Polynomial Arithmetic. SIAM J. Comput. 18(5): 955-976 (1989)
1984
1		Wayne Eberly: Very Fast Parallel Matrix and Polynomial Arithmetic FOCS 1984: 21-30

Coauthor Index

1	Nader H. Bshouty	[5] [8]
2	Richard Cleve	[5] [8]
3	Mark Giesbrecht	[11] [14] [16] [18] [21] [22] [23] [24]
4	Pascal Giorgi	[21] [22] [23] [24]
5	Lisa Higham	[13]
6	Bradford Hovinen	[20]
7	Erich Kaltofen	[12]
8	Arne Storjohann	[21] [22] [23] [24]
9	Gilles Villard	[16] [21] [22] [23] [24]
10	Jolanta Warpechowska-Gruca	[13]

Colors in the list of coauthors