Wayne Eberly
Impact in
- Computational Mathematics top 10%
-
- Polynomial and algebraic computation
- Matrix Theory and Algorithms
- Complexity and Algorithms in Graphs
- Numerical Methods and Algorithms
Papers in
-
- Matrix Theory and Algorithms 12
- Polynomial and algebraic computation 8
- Complexity and Algorithms in Graphs 6
- Numerical Methods and Algorithms 3
-
- Coding theory and cryptography 11
- Co-authors
- Mark Giesbrecht (5 shared papers)Gilles Villard (3 shared papers)Erich Kaltofen (2 shared papers)Joachim von zur Gathen (1 shared paper)Chen Li (1 shared paper)B. David Saunders (1 shared paper)Richard Cleve (2 shared papers)Nader H. Bshouty (2 shared papers)
- Journals
- SIAM Journal on Computing (2 papers)Computational Complexity (2 papers)Journal of Algorithms (1 paper)SIAM Review (1 paper)Information and Computation (1 paper)
- Partner nations
- CanadaFranceUnited States
In The Last Decade
Wayne Eberly
26 papers receiving 247 citations
Peers
Comparison fields: 5 of 35
- Computational Mathematics 16
- Computational Theory and Mathematics 214
- Discrete Mathematics and Combinatorics 34
- Algebra and Number Theory 27
- Artificial Intelligence 135
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 10 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 27 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 36 | |
| 2 | 2002 | 35 | |
| 3 | 1997 | 28 | |
| 4 | 1989 | 24 | |
| 5 | 2006 | 19 | |
| 6 | Computations for algebras and group representations | 1989 | 14 |
| 7 | 2000 | 13 | |
| 8 | 1991 | 13 | |
| 9 | 2003 | 13 | |
| 10 | 2002 | 11 | |
| 11 | 1991 | 11 | |
| 12 | 2000 | 8 | |
| 13 | 1997 | 8 | |
| 14 | 1996 | 8 | |
| 15 | 2003 | 6 | |
| 16 | 2000 | 6 | |
| 17 | 1995 | 5 | |
| 18 | 2004 | 4 | |
| 19 | 2005 | 3 | |
| 20 | 1992 | 2 |
About Wayne Eberly
Wayne Eberly is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Algebra and Number Theory and Computer Networks and Communications, having authored 27 papers that have together received 276 indexed citations. Recurring topics across this work include Matrix Theory and Algorithms (12 papers), Coding theory and cryptography (11 papers), Polynomial and algebraic computation (8 papers), graph theory and CDMA systems (7 papers), Complexity and Algorithms in Graphs (6 papers), Electromagnetic Scattering and Analysis (3 papers), Numerical Methods and Algorithms (3 papers) and Advanced Topics in Algebra (3 papers). The work is most often cited by research in Computational Mathematics (16 citations), Computational Theory and Mathematics (214 citations), Discrete Mathematics and Combinatorics (34 citations), Algebra and Number Theory (27 citations) and Artificial Intelligence (135 citations). Wayne Eberly has collaborated with scholars based in Canada, France and United States. Frequent co-authors include Mark Giesbrecht, Gilles Villard, Erich Kaltofen, Joachim von zur Gathen, Chen Li, B. David Saunders, Richard Cleve, Nader H. Bshouty, Pascal Giorgi and Arne Storjohann. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, Journal of Algorithms, SIAM Review and Information and Computation.
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.