Wayne Eberly - RankMe

35 papers A* 5A 1B 10Journal 15Unranked 3

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Automating algorithm selection: Checking for matrix properties that can simplify computations. J. Symb. Comput. Wayne Eberly
2016	J	`jnl`	Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields. CoRR Wayne Eberly
2016	J	`jnl`	Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fields. ACM Commun. Comput. Algebra Wayne Eberly
2016	B	`conf`	Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations. ISSAC Wayne Eberly
2016	J	`jnl`	Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations. CoRR Wayne Eberly
2013	—	`conf`	Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority. AFRICACRYPT Isheeta Nargis, Payman Mohassel, Wayne Eberly
2010	B	`conf`	Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. ISSAC Wayne Eberly
2007	J	`jnl`	Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections CoRR Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
2007	B	`conf`	Faster inversion and other black box matrix computations using efficient block projections. ISSAC Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
2006	J	`jnl`	Solving Sparse Integer Linear Systems CoRR Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
2006	B	`conf`	Solving sparse rational linear systems. ISSAC Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
2005	B	`conf`	A reliable block Lanczos algorithm over small finite fields. ISSAC Bradford Hovinen, Wayne Eberly
2004	J	`jnl`	Efficient decomposition of separable algebras. J. Symb. Comput. Wayne Eberly, Mark Giesbrecht
2004	B	`conf`	Reliable Krylov-based algorithms for matrix null space and rank. ISSAC Wayne Eberly
2003	B	`conf`	Early termination over small fields. ISSAC Wayne Eberly
2000	B	`conf`	Black box Frobenius decompositions over small fields. ISSAC Wayne Eberly
2000	A*	`conf`	Computing the Determinant and Smith Form of an Integer Matrix. FOCS Wayne Eberly, Mark Giesbrecht, Gilles Villard
2000	J	`jnl`	Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. Wayne Eberly, Mark Giesbrecht
1998	A	`conf`	Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca
1997	B	`conf`	On Randomized Lanczos Algorithms. ISSAC Wayne Eberly, Erich L. Kaltofen
1997	—	`conf`	Processor-efficient parallel matrix inversion over abstract fields: two extensions. PASCO Wayne Eberly
1996	B	`conf`	Efficient Decomposition of Associative Algebras. ISSAC Wayne Eberly, Mark Giesbrecht
1996	J	`jnl`	Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan). SIAM Rev. Wayne Eberly
1995	A*	`conf`	Efficient Parallel Computations for Singular Band Matrices. SODA Wayne Eberly
1995	J	`jnl`	Fast Parallel Band Matrix Arithmetic Inf. Comput. Wayne Eberly
1995	J	`jnl`	Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. Nader H. Bshouty, Richard Cleve, Wayne Eberly
1994	J	`jnl`	Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms Wayne Eberly
1992	A*	`conf`	On Efficient Band Matrix Arithmetic FOCS Wayne Eberly
1991	J	`jnl`	Decomposition of Algebras Over Finite Fields and Number Fields. Comput. Complex. Wayne Eberly
1991	J	`jnl`	Decompositions of Algebras Over R and C. Comput. Complex. Wayne Eberly
1991	—	`conf`	Efficient parallel independent subsets and matrix factorizations. SPDP Wayne Eberly
1991	A*	`conf`	Size-Depth Tradeoffs for Algebraic Formulae FOCS Nader H. Bshouty, Richard Cleve, Wayne Eberly
1989	—	`—`	Computations for algebras and group representations. Wayne Eberly
1989	J	`jnl`	Very Fast Parallel Polynomial Arithmetic. SIAM J. Comput. Wayne Eberly
1984	A*	`conf`	Very Fast Parallel Matrix and Polynomial Arithmetic FOCS Wayne Eberly