Wayne Eberly - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2019

Automating algorithm selection: Checking for matrix properties that can simplify computationsWayne Eberly. JSC, 94:1-29, 2019. [doi]

2016

Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify ComputationsWayne Eberly. issac 2016: 207-214 [doi]

Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fieldsWayne Eberly. cca, 50(4):164-166, 2016. [doi]

2013

Efficient Multiparty Computation for Arithmetic Circuits against a Covert MajorityIsheeta Nargis, Payman Mohassel, Wayne Eberly. africacrypt 2013: 260-278 [doi]

2010

Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field caseWayne Eberly. issac 2010: 289-296 [doi]

2007

Faster inversion and other black box matrix computations using efficient block projectionsWayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard. issac 2007: 143-150 [doi]

2006

Solving sparse rational linear systemsWayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard. issac 2006: 63-70 [doi]

2005

A reliable block Lanczos algorithm over small finite fieldsBradford Hovinen, Wayne Eberly. issac 2005: 177-184 [doi]

2004

Reliable Krylov-based algorithms for matrix null space and rankWayne Eberly. issac 2004: 127-134 [doi]

Efficient decomposition of separable algebrasWayne Eberly, Mark Giesbrecht. JSC, 37(1):35-81, 2004. [doi]

2003

Early termination over small fieldsWayne Eberly. issac 2003: 80-87 [doi]

2000

Black box Frobenius decompositions over small fieldsWayne Eberly. issac 2000: 106-113 [doi]

Efficient Decomposition of Associative Algebras over Finite FieldsWayne Eberly, Mark Giesbrecht. JSC, 29(3):441-458, 2000.

Computing the Determinant and Smith Form of an Integer MatrixWayne Eberly, Mark Giesbrecht, Gilles Villard. focs 2000: 675-685

1998

Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High ThroughputWayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca. wdag 1998: 149-160 [doi]

1997

On Randomized Lanczos AlgorithmsWayne Eberly, Erich Kaltofen. issac 1997: 176-183

Processor-efficient parallel matrix inversion over abstract fields: two extensionsWayne Eberly. cap 1997: 38-45 [doi]

1996

Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan)Wayne Eberly. siamrev, 38(1):161-165, 1996. [doi]

Efficient Decomposition of Associative AlgebrasWayne Eberly, Mark Giesbrecht. issac 1996: 170-178 [doi]

1995

Size-Depth Tradeoffs for Algebraic FormulasNader H. Bshouty, Richard Cleve, Wayne Eberly. SICOMP, 24(4):682-705, 1995.

Fast Parallel Band Matrix ArithmeticWayne Eberly. iandc, 116(1):117-127, January 1995.

Efficient Parallel Computations for Singular Band MatricesWayne Eberly. soda 1995: 132-138

1994

Logarithmic Depth Circuits for Hermite InterpolationWayne Eberly. jal, 16(3):335-360, 1994.

1992

On Efficient Band Matrix ArithmeticWayne Eberly. focs 1992: 457-463

1991

Size-Depth Tradeoffs for Algebraic FormulaeNader H. Bshouty, Richard Cleve, Wayne Eberly. focs 1991: 334-341

Efficient parallel independent subsets and matrix factorizationsWayne Eberly. spdp 1991: 204-211 [doi]

Decompositions of Algebras Over R and CWayne Eberly. cc, 1:211-234, 1991.

Decomposition of Algebras Over Finite Fields and Number FieldsWayne Eberly. cc, 1:183-210, 1991.

1989

Very Fast Parallel Polynomial ArithmeticWayne Eberly. SICOMP, 18(5):955-976, 1989.

Computations for algebras and group representationsWayne Eberly. PhD thesis, University of Toronto, Canada, 1989. [doi]

1984

Very Fast Parallel Matrix and Polynomial ArithmeticWayne Eberly. focs 1984: 21-30

Sign in or sign up to see more results.

runs on WebDSL