Wayne Eberly
Impact in
- Computational Mathematics top 5%
-
- Polynomial and algebraic computation
- Complexity and Algorithms in Graphs
- Matrix Theory and Algorithms
- Advanced Graph Theory Research
Papers in
-
- Matrix Theory and Algorithms 14
- Polynomial and algebraic computation 8
- Complexity and Algorithms in Graphs 8
- Numerical Methods and Algorithms 3
- semigroups and automata theory 3
-
- Coding theory and cryptography 13
- Co-authors
- Mark Giesbrecht (5 shared papers)Gilles Villard (3 shared papers)Erich Kaltofen (2 shared papers)Joachim von zur Gathen (1 shared paper)Richard Cleve (2 shared papers)Nader H. Bshouty (2 shared papers)Chen Li (1 shared paper)B. David Saunders (1 shared paper)
- Journals
- Computational Complexity (2 papers)SIAM Journal on Computing (2 papers)Information and Computation (1 paper)Journal of Algorithms (1 paper)SIAM Review (1 paper)
- Partner nations
- CanadaFranceUnited States
In The Last Decade
Wayne Eberly
31 papers receiving 316 citations
Peers
Comparison fields: 5 of 38
- Computational Mathematics 18
- Computational Theory and Mathematics 262
- Discrete Mathematics and Combinatorics 38
- Algebra and Number Theory 30
- Artificial Intelligence 175
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 12 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 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 42 | |
| 2 | 2002 | 41 | |
| 3 | 1997 | 35 | |
| 4 | 1989 | 30 | |
| 5 | 2006 | 21 | |
| 6 | Computations for algebras and group representations | 1989 | 18 |
| 7 | 2000 | 15 | |
| 8 | 2002 | 15 | |
| 9 | 1998 | 13 | |
| 10 | 2003 | 13 | |
| 11 | 1991 | 13 | |
| 12 | 1991 | 12 | |
| 13 | 2000 | 10 | |
| 14 | 1996 | 9 | |
| 15 | 2000 | 8 | |
| 16 | 1997 | 8 | |
| 17 | 1995 | 8 | |
| 18 | 2003 | 6 | |
| 19 | 2005 | 5 | |
| 20 | 2004 | 5 |
About Wayne Eberly
Wayne Eberly is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Atomic and Molecular Physics, and Optics, having authored 31 papers that have together received 348 indexed citations. Recurring topics across this work include Matrix Theory and Algorithms (14 papers), Coding theory and cryptography (13 papers), Polynomial and algebraic computation (8 papers), Complexity and Algorithms in Graphs (8 papers), graph theory and CDMA systems (7 papers), Electromagnetic Scattering and Analysis (4 papers), Numerical Methods and Algorithms (3 papers) and semigroups and automata theory (3 papers). The work is most often cited by research in Computational Mathematics (18 citations), Computational Theory and Mathematics (262 citations), Discrete Mathematics and Combinatorics (38 citations), Algebra and Number Theory (30 citations) and Artificial Intelligence (175 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, Richard Cleve, Nader H. Bshouty, Chen Li, B. David Saunders, Arne Storjohann and Lisa Highám. Their work appears in journals such as Computational Complexity, SIAM Journal on Computing, Information and Computation, Journal of Algorithms and SIAM Review.
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.