J. Ian Munro

6.6k total citations
126 papers, 2.2k citations indexed

About

J. Ian Munro is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, J. Ian Munro has authored 126 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 96 papers in Artificial Intelligence, 48 papers in Computer Networks and Communications and 40 papers in Computational Theory and Mathematics. Recurrent topics in J. Ian Munro's work include Algorithms and Data Compression (90 papers), Data Management and Algorithms (29 papers) and semigroups and automata theory (23 papers). J. Ian Munro is often cited by papers focused on Algorithms and Data Compression (90 papers), Data Management and Algorithms (29 papers) and semigroups and automata theory (23 papers). J. Ian Munro collaborates with scholars based in Canada, United States and Chile. J. Ian Munro's co-authors include Venkatesh Raman, Mike Paterson, Erik D. Demaine, Srinivasa Rao Satti, Gastón H. Gonnet, Alejandro López-Ortíz, Andrej Brodnik, Alexander Golynski, Meng He and Jérémy Barbay and has published in prestigious journals such as Operations Research, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

J. Ian Munro

116 papers receiving 2.0k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
J. Ian Munro Canada	24	1.5k	954	569	564	322	126	2.2k
Edward M. McCreight United States	9	1.3k 0.9×	904 0.9×	370 0.7×	676 1.2×	305 0.9×	12	2.2k
Venkatesh Raman India	22	970 0.6×	639 0.7×	1.0k 1.8×	182 0.3×	163 0.5×	111	1.9k
Derick Wood Canada	21	927 0.6×	401 0.4×	725 1.3×	252 0.4×	233 0.7×	152	1.7k
Fabrizio Luccio Italy	19	586 0.4×	559 0.6×	580 1.0×	379 0.7×	201 0.6×	102	1.7k
Rasmus Pagh Denmark	21	1.3k 0.9×	1.2k 1.2×	387 0.7×	290 0.5×	515 1.6×	88	2.3k
S. Rao Kosaraju United States	23	624 0.4×	440 0.5×	721 1.3×	217 0.4×	286 0.9×	78	1.6k
Brenda S. Baker United States	22	671 0.4×	700 0.7×	821 1.4×	459 0.8×	132 0.4×	44	3.0k
Marek Karpiński Germany	26	1.2k 0.8×	917 1.0×	1.6k 2.8×	167 0.3×	174 0.5×	190	2.8k
Jan Van Leeuwen Netherlands	14	1.6k 1.1×	683 0.7×	1.6k 2.9×	164 0.3×	120 0.4×	44	2.8k
Srinivasa Rao Satti South Korea	19	924 0.6×	749 0.8×	603 1.1×	180 0.3×	190 0.6×	70	1.6k

Countries citing papers authored by J. Ian Munro

Since Specialization

Citations

This map shows the geographic impact of J. 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 J. 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 J. Ian Munro more than expected).

Fields of papers citing papers by J. Ian Munro

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J. 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 J. Ian Munro. The network helps show where J. Ian Munro may publish in the future.

Co-authorship network of co-authors of J. Ian Munro

This figure shows the co-authorship network connecting the top 25 collaborators of J. Ian Munro. A scholar is included among the top collaborators of J. 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 J. Ian Munro. J. 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:

20 of 20 papers shown

He, Meng, et al.. (2018). Improved Time and Space Bounds for Dynamic Range Mode. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Munro, J. Ian & Sebastian Wild. (2018). Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.. European Symposium on Algorithms. 16. 1 indexed citations

Larsen, Kasper Green, et al.. (2015). On hardness of several string indexing problems. Theoretical Computer Science. 582. 74–82. 5 indexed citations

Lewenstein, Moshe, J. Ian Munro, Venkatesh Raman, & Sharma V. Thankachan. (2014). Less space: Indexing for queries with wildcards. Theoretical Computer Science. 557. 120–127. 3 indexed citations

Durocher, Stéphane, et al.. (2014). Low Space Data Structures for Geometric Range Mode Query.. Canadian Conference on Computational Geometry. 1 indexed citations

He, Meng & J. Ian Munro. (2013). Space efficient data structures for dynamic orthogonal range counting. Computational Geometry. 47(2). 268–281.

Farzan, Arash & J. Ian Munro. (2013). Succinct encoding of arbitrary graphs. Theoretical Computer Science. 513. 38–52. 19 indexed citations

Munro, J. Ian, Rajeev Raman, Venkatesh Raman, & Srinivasa Rao Satti. (2012). Succinct representations of permutations and functions. Theoretical Computer Science. 438. 74–88. 27 indexed citations

Barbay, Jérémy, Meng He, J. Ian Munro, & Srinivasa Rao Satti. (2007). Succinct indexes for strings, binary relations and multi-labeled trees. Symposium on Discrete Algorithms. 680–689. 33 indexed citations

10.

Barbay, Jérémy, et al.. (2007). Succinct representation of labeled graphs. Lecture notes in computer science. 316–328. 7 indexed citations

11.

Munro, J. Ian, et al.. (2006). Implicit dictionaries with O(1) modifications per update and fast search. Symposium on Discrete Algorithms. 404–413. 1 indexed citations

12.

He, Meng, J. Ian Munro, & Srinivasa Rao Satti. (2005). A categorization theorem on suffix arrays with applications to space efficient text indexes. Symposium on Discrete Algorithms. 23–32. 15 indexed citations

13.

Brodnik, Andrej, Svante Carlsson, Johan Karlsson, & J. Ian Munro. (2001). Worst case constant time priority queue. Symposium on Discrete Algorithms. 523–528. 7 indexed citations

14.

Munro, J. Ian, Venkatesh Raman, & Adam Storm. (2001). Representing dynamic binary trees succinctly. Symposium on Discrete Algorithms. 529–536. 19 indexed citations

15.

Demaine, Erik D., Alejandro López-Ortíz, & J. Ian Munro. (2001). On universally easy classes for NP-complete problems. Symposium on Discrete Algorithms. 910–911. 1 indexed citations

16.

Demaine, Erik D., Alejandro López-Ortíz, & J. Ian Munro. (2000). Adaptive set intersections, unions, and differences. Symposium on Discrete Algorithms. 743–752. 92 indexed citations

17.

Munro, J. Ian & Venkatesh Raman. (1996). Selection from read-only memory and sorting with minimum data movement. Theoretical Computer Science. 165(2). 311–323. 29 indexed citations

18.

Munro, J. Ian, et al.. (1992). Deterministic skip lists. Symposium on Discrete Algorithms. 367–375. 53 indexed citations

19.

Munro, J. Ian, et al.. (1986). Techniques for collision resolution in hash tables with open addressing. 601–610. 9 indexed citations

20.

Larson, Per-Åke, et al.. (1985). Robin Hood Hashing (Preliminary Report). 281–288. 4 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