Ian Munro
Impact in
- Computational Mathematics top 5%
-
- Complexity and Algorithms in Graphs
- Polynomial and algebraic computation
- Numerical Methods and Algorithms
- Advanced Graph Theory Research
- Matrix Theory and Algorithms
Papers in
-
- Numerical Methods and Algorithms 4
- Polynomial and algebraic computation 3
- Computability, Logic, AI Algorithms 3
- Advanced Graph Theory Research 2
-
- Algorithms and Data Compression 6
- Co-authors
- Allan Borodin (3 shared papers)Michael S. Paterson (2 shared papers)Philip M. Spira (1 shared paper)Tsunehiko Kameda (1 shared paper)Gastón H. Gonnet (1 shared paper)Yakov Nekrich (1 shared paper)Jeffrey Scott Vitter (1 shared paper)Alfredo Viola (1 shared paper)
- Journals
- Journal of Computer and System Sciences (2 papers)Journal of the ACM (1 paper)Proceedings of the IEEE (1 paper)Informatics in Education (1 paper)SIAM Journal on Computing (1 paper)
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Ian Munro
16 papers receiving 612 citations
Peers
Comparison fields: 5 of 68
- Computational Mathematics 35
- Computational Theory and Mathematics 409
- Hardware and Architecture 84
- Discrete Mathematics and Combinatorics 37
- Signal Processing 99
Countries citing papers authored by Ian Munro
This map shows the geographic impact of Ian Munro'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 Ian Munro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ian Munro more than expected).
Fields of papers citing papers by Ian Munro
This network shows the impact of papers produced by Ian Munro. 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 Ian Munro. The network helps show where Ian Munro may publish in the future.
Co-authors
The 9 scholars most cited alongside Ian Munro, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS. | 1975 | 268 |
| 2 | 1971 | 106 | |
| 3 | Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms | 2004 | 96 |
| 4 | 1978 | 59 | |
| 5 | 1973 | 58 | |
| 6 | 1976 | 39 | |
| 7 | 1974 | 22 | |
| 8 | 1971 | 14 | |
| 9 | 1971 | 12 | |
| 10 | 2006 | 8 | |
| 11 | 2015 | 8 | |
| 12 | 1977 | 8 | |
| 13 | Analysis of hashing algorithms and a new mathematical transform | 1996 | 7 |
| 14 | 1971 | 7 | |
| 15 | 1972 | 6 | |
| 16 | 1976 | 3 | |
| 17 | 1978 | 0 |
About Ian Munro
Ian Munro is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Signal Processing and Molecular Biology, having authored 17 papers that have together received 721 indexed citations. Recurring topics across this work include Algorithms and Data Compression (6 papers), Numerical Methods and Algorithms (4 papers), Digital Filter Design and Implementation (3 papers), Polynomial and algebraic computation (3 papers), Computability, Logic, AI Algorithms (3 papers), DNA and Biological Computing (3 papers), Advanced Database Systems and Queries (2 papers) and Advanced Graph Theory Research (2 papers). The work is most often cited by research in Computational Mathematics (35 citations), Computational Theory and Mathematics (409 citations), Hardware and Architecture (84 citations), Discrete Mathematics and Combinatorics (37 citations) and Signal Processing (99 citations). Ian Munro has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Allan Borodin, Michael S. Paterson, Philip M. Spira, Tsunehiko Kameda, Gastón H. Gonnet, Yakov Nekrich, Jeffrey Scott Vitter, Alfredo Viola and Gordon V. Cormack. Their work appears in journals such as Journal of Computer and System Sciences, Journal of the ACM, Proceedings of the IEEE, Informatics in Education 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.