Wayne Eberly

Wayne M. Eberly

	2010
27		Wayne Eberly: Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. ISSAC 2010: 289-296
	2007
26		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
25		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
24		Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving sparse rational linear systems. ISSAC 2006: 63-70
23		Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving Sparse Integer Linear Systems CoRR abs/cs/0603082: (2006)
	2005
22		Bradford Hovinen, Wayne Eberly: A reliable block Lanczos algorithm over small finite fields. ISSAC 2005: 177-184
	2004
21		Wayne Eberly: Reliable Krylov-based algorithms for matrix null space and rank. ISSAC 2004: 127-134
20		Wayne Eberly, Mark Giesbrecht: Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004)
	2003
19		Wayne Eberly: Early termination over small fields. ISSAC 2003: 80-87
	2000
18		Wayne Eberly, Mark Giesbrecht, Gilles Villard: Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685
17		Wayne Eberly: Black box Frobenius decompositions over small fields. ISSAC 2000: 106-113
16		Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000)
	1998
15		Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca: Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC 1998: 149-160
	1997
14		Wayne Eberly, Erich Kaltofen: On Randomized Lanczos Algorithms. ISSAC 1997: 176-183
13		Wayne Eberly: Processor-efficient parallel matrix inversion over abstract fields: two extensions. PASCO 1997: 38-45
	1996
12		Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras. ISSAC 1996: 170-178
	1995
11		Wayne Eberly: Efficient Parallel Computations for Singular Band Matrices. SODA 1995: 132-138
10		Wayne Eberly: Fast Parallel Band Matrix Arithmetic Inf. Comput. 116(1): 117-127 (1995)
9		Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995)
	1994
8		Wayne Eberly: Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms 16(3): 335-360 (1994)
	1992
7		Wayne Eberly: On Efficient Band Matrix Arithmetic FOCS 1992: 457-463
	1991
6		Nader H. Bshouty, Richard Cleve, Wayne Eberly: Size-Depth Tradeoffs for Algebraic Formulae FOCS 1991: 334-341
5		Wayne Eberly: Efficient parallel independent subsets and matrix factorizations. SPDP 1991: 204-211
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	[6] [9]
2	Richard Cleve	[6] [9]
3	Mark Giesbrecht	[12] [16] [18] [20] [23] [24] [25] [26]
4	Pascal Giorgi	[23] [24] [25] [26]
5	Lisa Higham	[15]
6	Bradford Hovinen	[22]
7	Erich Kaltofen	[14]
8	Arne Storjohann	[23] [24] [25] [26]
9	Gilles Villard	[18] [23] [24] [25] [26]
10	Jolanta Warpechowska-Gruca (Jolanta Warpechowska)	[15]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page