Ian Munro

1.3k total citations
17 papers, 718 citations indexed

About

Ian Munro is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Ian Munro has authored 17 papers receiving a total of 718 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Ian Munro's work include Algorithms and Data Compression (6 papers), Numerical Methods and Algorithms (4 papers) and Polynomial and algebraic computation (3 papers). Ian Munro is often cited by papers focused on Algorithms and Data Compression (6 papers), Numerical Methods and Algorithms (4 papers) and Polynomial and algebraic computation (3 papers). Ian Munro collaborates with scholars based in Canada, United States and United Kingdom. Ian Munro's co-authors include Allan Borodin, Michael S. Paterson, Philip M. Spira, Tsunehiko Kameda, Gastón H. Gonnet, Jeffrey Scott Vitter, Yakov Nekrich, Alfredo Viola and Gordon V. Cormack and has published in prestigious journals such as Proceedings of the IEEE, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Ian Munro

16 papers receiving 609 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ian Munro Canada	9	408	281	198	99	98	17	718
W. Fernandez de la Véga France	15	414 1.0×	160 0.6×	315 1.6×	83 0.8×	90 0.9×	39	897
Nader H. Bshouty Israel	18	536 1.3×	872 3.1×	166 0.8×	35 0.4×	100 1.0×	123	1.1k
Richard Zippel United States	13	360 0.9×	257 0.9×	133 0.7×	33 0.3×	61 0.6×	28	614
Peter Bro Miltersen Denmark	18	628 1.5×	712 2.5×	252 1.3×	58 0.6×	69 0.7×	78	1.1k
Ravindran Kannan United States	14	336 0.8×	330 1.2×	93 0.5×	83 0.8×	71 0.7×	28	848
Gilles Villard France	16	409 1.0×	242 0.9×	94 0.5×	20 0.2×	105 1.1×	44	605
Martin Fürer United States	13	473 1.2×	294 1.0×	201 1.0×	32 0.3×	108 1.1×	38	744
François Le Gall Japan	8	296 0.7×	317 1.1×	105 0.5×	32 0.3×	62 0.6×	35	573
Feodor F. Dragan United States	20	781 1.9×	86 0.3×	275 1.4×	74 0.7×	115 1.2×	82	1.0k
Virginia Vassilevska Williams United States	18	853 2.1×	472 1.7×	403 2.0×	92 0.9×	75 0.8×	71	1.3k

Countries citing papers authored by Ian Munro

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Ian Munro

This figure shows the co-authorship network connecting the top 25 collaborators of Ian Munro. A scholar is included among the top collaborators of Ian Munro based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ian Munro. Ian Munro is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

1.

Munro, Ian, Yakov Nekrich, & Jeffrey Scott Vitter. (2015). Dynamic Data Structures for Document Collections and Graphs. 277–289. 8 indexed citations

2.

Cormack, Gordon V., et al.. (2006). Structure, Scoring and Purpose of Computing Competitions. Informatics in Education. 5(1). 15–36. 8 indexed citations

3.

Munro, Ian. (2004). Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. 95 indexed citations

4.

Munro, Ian, et al.. (1996). Analysis of hashing algorithms and a new mathematical transform. 7 indexed citations

5.

Munro, Ian. (1978). The complexity of computing. Proceedings of the IEEE. 66(9). 1102–1102.

6.

Munro, Ian, et al.. (1978). Self-Organizing Binary Search Trees. Journal of the ACM. 25(4). 526–535. 59 indexed citations

7.

Gonnet, Gastón H. & Ian Munro. (1977). The analysis of an improved hashing technique. 113–121. 8 indexed citations

8.

Munro, Ian, et al.. (1976). Self-organizing binary search trees. iii. 166–172. 3 indexed citations

9.

Munro, Ian & Philip M. Spira. (1976). Sorting and Searching in Multisets. SIAM Journal on Computing. 5(1). 1–8. 39 indexed citations

10.

Borodin, Allan & Ian Munro. (1975). THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.. CERN Document Server (European Organization for Nuclear Research). 268 indexed citations

11.

Kameda, Tsunehiko & Ian Munro. (1974). A O(|V|·|E|) algorithm for maximum matching of graphs. Computing. 12(1). 91–98. 22 indexed citations

12.

Munro, Ian & Michael S. Paterson. (1973). Optimal algorithms for parallel polynomial evaluation. Journal of Computer and System Sciences. 7(2). 189–198. 58 indexed citations

13.

Munro, Ian & Allan Borodin. (1972). Efficient evaluation of polynomial forms. Journal of Computer and System Sciences. 6(6). 625–638. 6 indexed citations

14.

Munro, Ian. (1971). Some results concerning efficient and optimal algorithms. 40–44. 7 indexed citations

15.

Munro, Ian & Michael S. Paterson. (1971). Optimal algorithms for parallel polynomial evaluation. 132–139. 12 indexed citations

16.

Munro, Ian. (1971). Efficient determination of the transitive closure of a directed graph. Information Processing Letters. 1(2). 56–58. 104 indexed citations

17.

Borodin, Allan & Ian Munro. (1971). Evaluating polynomials at many points. Information Processing Letters. 1(2). 66–68. 14 indexed citations

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.

Explore authors with similar magnitude of impact