default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWayne Eberly
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]Wayne Eberly:
Automating algorithm selection: Checking for matrix properties that can simplify computations. J. Symb. Comput. 94: 1-29 (2019)- 2016
- [j10]Wayne Eberly:
Black box linear algebra: extending wiedemann's analysis of a sparse matrix preconditioner for computations over small fields. ACM Commun. Comput. Algebra 50(4): 164-166 (2016) - [c19]Wayne Eberly:
Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations. ISSAC 2016: 207-214 - [i4]Wayne Eberly:
Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations. CoRR abs/1607.04499 (2016) - [i3]Wayne Eberly:
Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields. CoRR abs/1607.04514 (2016) - 2013
- [c18]Isheeta Nargis, Payman Mohassel, Wayne Eberly:
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority. AFRICACRYPT 2013: 260-278 - 2010
- [c17]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
2000 – 2009
- 2007
- [c16]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 - [i2]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
- [c15]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving sparse rational linear systems. ISSAC 2006: 63-70 - [i1]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving Sparse Integer Linear Systems. CoRR abs/cs/0603082 (2006) - 2005
- [c14]Bradford Hovinen, Wayne Eberly:
A reliable block Lanczos algorithm over small finite fields. ISSAC 2005: 177-184 - 2004
- [j9]Wayne Eberly, Mark Giesbrecht:
Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004) - [c13]Wayne Eberly:
Reliable Krylov-based algorithms for matrix null space and rank. ISSAC 2004: 127-134 - 2003
- [c12]Wayne Eberly:
Early termination over small fields. ISSAC 2003: 80-87 - 2000
- [j8]Wayne Eberly, Mark Giesbrecht:
Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000) - [c11]Wayne Eberly, Mark Giesbrecht, Gilles Villard:
Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685 - [c10]Wayne Eberly:
Black box Frobenius decompositions over small fields. ISSAC 2000: 106-113
1990 – 1999
- 1998
- [c9]Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca:
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. DISC 1998: 149-160 - 1997
- [c8]Wayne Eberly:
Processor-efficient parallel matrix inversion over abstract fields: two extensions. PASCO 1997: 38-45 - [c7]Wayne Eberly, Erich L. Kaltofen
:
On Randomized Lanczos Algorithms. ISSAC 1997: 176-183 - 1996
- [j7]Wayne Eberly:
Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Dario Bini and Victor Pan). SIAM Rev. 38(1): 161-165 (1996) - [c6]Wayne Eberly, Mark Giesbrecht:
Efficient Decomposition of Associative Algebras. ISSAC 1996: 170-178 - 1995
- [j6]Wayne Eberly:
Fast Parallel Band Matrix Arithmetic. Inf. Comput. 116(1): 117-127 (1995) - [j5]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995) - [c5]Wayne Eberly:
Efficient Parallel Computations for Singular Band Matrices. SODA 1995: 132-138 - 1994
- [j4]Wayne Eberly:
Logarithmic Depth Circuits for Hermite Interpolation. J. Algorithms 16(3): 335-360 (1994) - 1992
- [c4]Wayne Eberly:
On Efficient Band Matrix Arithmetic. FOCS 1992: 457-463 - 1991
- [j3]Wayne Eberly:
Decomposition of Algebras Over Finite Fields and Number Fields. Comput. Complex. 1: 183-210 (1991) - [j2]Wayne Eberly:
Decompositions of Algebras Over R and C. Comput. Complex. 1: 211-234 (1991) - [c3]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulae. FOCS 1991: 334-341 - [c2]Wayne Eberly:
Efficient parallel independent subsets and matrix factorizations. SPDP 1991: 204-211
1980 – 1989
- 1989
- [b1]Wayne Eberly:
Computations for algebras and group representations. University of Toronto, Canada, 1989 - [j1]Wayne Eberly:
Very Fast Parallel Polynomial Arithmetic. SIAM J. Comput. 18(5): 955-976 (1989) - 1984
- [c1]Wayne Eberly:
Very Fast Parallel Matrix and Polynomial Arithmetic. FOCS 1984: 21-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
