Wayne Eberly
Impact in
-
- Polynomial and algebraic computation
- Matrix Theory and Algorithms
- Complexity and Algorithms in Graphs
- Algebra and Number Theory top 10%
- Rings, Modules, and Algebras
Papers in
-
- Polynomial and algebraic computation 23
- Matrix Theory and Algorithms 11
- Complexity and Algorithms in Graphs 7
-
- Rings, Modules, and Algebras 2
- Advanced Topics in Algebra 2
- Co-authors
- Mark W. Giesbrecht (6 shared papers)Gilles Villard (4 shared papers)Erich Kaltofen (2 shared papers)Joachim von zur Gathen (1 shared paper)Arne Storjohann (2 shared papers)Pascal Giorgi A (2 shared papers)Richard Cleve (2 shared papers)Nader H. Bshouty (2 shared papers)
- Journals
- SIAM Journal on Computing (2 papers)Computational Complexity (2 papers)SIAM Review (1 paper)Information and Computation (1 paper)Journal of Algorithms (1 paper)
- Partner nations
- CanadaFranceUnited States
In The Last Decade
Wayne Eberly
32 papers receiving 389 citations
Peers
Comparison fields: 5 of 26
- Computational Theory and Mathematics 304
- Algebra and Number Theory 42
- Discrete Mathematics and Combinatorics 24
- Computational Mathematics 2
- Numerical Analysis 9
Countries citing papers authored by Wayne Eberly
This map shows the geographic impact of Wayne Eberly's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Wayne Eberly with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wayne Eberly more than expected).
Fields of papers citing papers by Wayne Eberly
This network shows the impact of papers produced by Wayne Eberly. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Wayne Eberly. The network helps show where Wayne Eberly may publish in the future.
Co-authors
The 11 scholars most cited alongside Wayne Eberly, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 47 | |
| 2 | 2002 | 45 | |
| 3 | 1997 | 39 | |
| 4 | 1989 | 30 | |
| 5 | 2006 | 26 | |
| 6 | 2007 | 24 | |
| 7 | Computations for algebras and group representations | 1989 | 22 |
| 8 | 1991 | 17 | |
| 9 | 2000 | 17 | |
| 10 | 1991 | 16 | |
| 11 | 1998 | 16 | |
| 12 | 2002 | 16 | |
| 13 | 2003 | 14 | |
| 14 | 1995 | 12 | |
| 15 | 2000 | 12 | |
| 16 | 1996 | 11 | |
| 17 | 1997 | 9 | |
| 18 | 2000 | 9 | |
| 19 | 2003 | 7 | |
| 20 | 2004 | 6 |
About Wayne Eberly
Wayne Eberly is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory, Discrete Mathematics and Combinatorics, Information Systems and Geometry and Topology, having authored 32 papers that have together received 421 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (23 papers), Matrix Theory and Algorithms (11 papers), Complexity and Algorithms in Graphs (7 papers), Rings, Modules, and Algebras (2 papers), Advanced Topics in Algebra (2 papers), Cryptography and Residue Arithmetic (2 papers), Cryptography and Data Security (1 paper) and Algebraic structures and combinatorial models (1 paper). The work is most often cited by research in Computational Theory and Mathematics (304 citations), Algebra and Number Theory (42 citations), Discrete Mathematics and Combinatorics (24 citations), Computational Mathematics (2 citations) and Numerical Analysis (9 citations). Wayne Eberly has collaborated with scholars based in Canada, France and United States. Frequent co-authors include Mark W. Giesbrecht, Gilles Villard, Erich Kaltofen, Joachim von zur Gathen, Arne Storjohann, Pascal Giorgi A, Richard Cleve, Nader H. Bshouty, B. David Saunders and Lisa Highám. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, SIAM Review, Information and Computation and Journal of Algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.