Mark Giesbrecht
Impact in
- Computational Mathematics top 5%
-
- Polynomial and algebraic computation
- Numerical Methods and Algorithms
- Complexity and Algorithms in Graphs
- Matrix Theory and Algorithms
Papers in
-
- Polynomial and algebraic computation 35
- Complexity and Algorithms in Graphs 8
- Numerical Methods and Algorithms 8
- Matrix Theory and Algorithms 7
-
- Coding theory and cryptography 19
- Co-authors
- Wayne Eberly (5 shared papers)Daniel S. Roche (8 shared papers)Wen-shin Lee (4 shared papers)George Labahn (4 shared papers)Joachim von zur Gathen (1 shared paper)Gilles Villard (2 shared papers)Arne Storjohann (3 shared papers)Stephen M. Watt (3 shared papers)
- Journals
- Computational Complexity (2 papers)Journal of Symbolic Computation (11 papers)Advances in Difference Equations (1 paper)Algorithmica (1 paper)SIAM Journal on Computing (1 paper)
- Partner nations
- CanadaUnited StatesChina
In The Last Decade
Mark Giesbrecht
46 papers receiving 496 citations
Peers
Comparison fields: 5 of 43
- Computational Mathematics 21
- Computational Theory and Mathematics 409
- Discrete Mathematics and Combinatorics 65
- Algebra and Number Theory 67
- Numerical Analysis 41
Countries citing papers authored by Mark Giesbrecht
This map shows the geographic impact of Mark Giesbrecht'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 Mark Giesbrecht with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Giesbrecht more than expected).
Fields of papers citing papers by Mark Giesbrecht
This network shows the impact of papers produced by Mark Giesbrecht. 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 Mark Giesbrecht. The network helps show where Mark Giesbrecht may publish in the future.
Co-authors
The 25 scholars most cited alongside Mark Giesbrecht, 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 50 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 52 | |
| 2 | 2008 | 39 | |
| 3 | 2002 | 36 | |
| 4 | 2001 | 35 | |
| 5 | 1990 | 33 | |
| 6 | 1998 | 33 | |
| 7 | 1998 | 19 | |
| 8 | 2006 | 19 | |
| 9 | 2006 | 17 | |
| 10 | 1999 | 17 | |
| 11 | 1995 | 16 | |
| 12 | 2011 | 16 | |
| 13 | 2015 | 15 | |
| 14 | 2001 | 15 | |
| 15 | 2000 | 13 | |
| 16 | 2003 | 13 | |
| 17 | 2003 | 13 | |
| 18 | 2003 | 12 | |
| 19 | 1997 | 12 | |
| 20 | 2002 | 11 |
About Mark Giesbrecht
Mark Giesbrecht is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Information Systems and Algebra and Number Theory, having authored 50 papers that have together received 539 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (35 papers), Coding theory and cryptography (19 papers), graph theory and CDMA systems (8 papers), Complexity and Algorithms in Graphs (8 papers), Numerical Methods and Algorithms (8 papers), Cryptography and Residue Arithmetic (7 papers), Matrix Theory and Algorithms (7 papers) and Algebraic Geometry and Number Theory (4 papers). The work is most often cited by research in Computational Mathematics (21 citations), Computational Theory and Mathematics (409 citations), Discrete Mathematics and Combinatorics (65 citations), Algebra and Number Theory (67 citations) and Numerical Analysis (41 citations). Mark Giesbrecht has collaborated with scholars based in Canada, United States and China. Frequent co-authors include Wayne Eberly, Daniel S. Roche, Wen-shin Lee, George Labahn, Joachim von zur Gathen, Gilles Villard, Arne Storjohann, Stephen M. Watt, Robert M. Corless and Ilias Kotsireas. Their work appears in journals such as Computational Complexity, Journal of Symbolic Computation, Advances in Difference Equations, Algorithmica and SIAM Journal on Computing.
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.