World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
8541
World Ranking
7550
National Ranking
305

Research.com Recognitions

  • 2003 - Fellow of the Royal Society of Canada Academy of Science

Overview

J. Ian Munro is affiliated with the University of Waterloo in Canada and works primarily in the field of Computer Science. Their research covers several subfields including Artificial Intelligence, Computational Theory and Mathematics, Molecular Biology, Computer Networks and Communications, and Hardware and Architecture.

Their main areas of work focus on Algorithms and Data Compression, DNA and Biological Computing, semigroups and automata theory, Network Packet Processing and Optimization, Complexity and Algorithms in Graphs, Data Management and Algorithms, and Advanced Graph Theory Research.

Recent publications by J. Ian Munro include the following papers:

  • Text Indexing and Searching in Sublinear Time, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Space-Efficient Data Structures for Lattices, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Other papers associated with Munro's research group or frequent collaborations include:

  • A Simple Algorithm for Optimal Search Trees with Two-way Comparisons, 2021, ACM Transactions on Algorithms
  • Range Majorities and Minorities in Arrays, 2021, Algorithmica
  • Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Munro frequently collaborates with several researchers, including Yakov Nekrich, Meng He, Kaiyu Wu, Gonzalo Navarro, and Marek Chrobák. These collaborations are reflected in multiple joint publications and research contributions.

The primary venues where Munro's work has been published are:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Algorithmica
  • ACM Transactions on Algorithms
  • Acta Informatica
  • arXiv (Cornell University)

In 2003, Munro was recognized as a Fellow of the Royal Society of Canada, Academy of Science.

Best Publications

  • Frequency estimation of Internet packet streams with limited space

    Erik D. Demaine;Alejandro Lopez-Ortiz;J. Ian Munro

  • Succinct Representation of Balanced Parentheses and Static Trees

    J. Ian Munro;Venkatesh Raman

  • Efficient suffix trees on secondary storage

    David R. Clark;J. Ian Munro

  • Representing Trees of Higher Degree

    David Benoit;Erik D. Demaine;J. Ian Munro;Rajeev Raman

  • Adaptive set intersections, unions, and differences

    Erik D. Demaine;Alejandro López-Ortiz;J. Ian Munro

  • Rank/select operations on large alphabets: a tool for text indexing

    Alexander Golynski;J. Ian Munro;S. Srinivasa Rao

  • Succinct representation of balanced parentheses, static trees and planar graphs

    J.I. Munro;V. Raman

  • Space Efficient Suffix Trees

    J.Ian Munro;Venkatesh Raman;S.Srinivasa Rao

  • Identifying frequent items in sliding windows over on-line packet streams

    Lukasz Golab;David DeHaan;Erik D. Demaine;Alejandro Lopez-Ortiz

  • Space Efficient Suffix Trees

    J. Ian Munro;Venkatesh Raman;S. Srinivasa Rao

  • Membership in Constant Time and Almost-Minimum Space

    Andrej Brodnik;J. Ian Munro

  • Self-Organizing Binary Search Trees

    Brian Allen;Ian Munro

  • Cache-oblivious priority queue and graph algorithm applications

    Lars Arge;Michael A. Bender;Erik D. Demaine;Bryan Holland-Minkley

  • Heaps on heaps

    Gaston H Gonnet;J Ian Munro

  • Deterministic skip lists

    J. Ian Munro;Thomas Papadakis;Robert Sedgewick

  • An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time

    J Ian Munro

  • Robin hood hashing

    Pedro Celis;Per-Ake Larson;J. Ian Munro

  • ONLINE ROUTING IN CONVEX SUBDIVISIONS

    Prosenjit Bose;Andrej Brodnik;Svante Carlsson;Erik D. Demaine

  • Succinct representations of permutations

    J. Ian Munro;Rajeev Raman;Venkatesh Raman;Satti Srinivasa Rao

  • Implicit data structures for fast search and update

    J.Ian Munro;Hendra Suwanda

  • Selection from read-only memory and sorting with minimum data movement

    J. Ian Munro;Venkatesh Raman

Frequent Co-Authors

Venkatesh Raman
Venkatesh Raman Indian Institute of Technology Palakkad
Timothy M. Chan
Timothy M. Chan University of Illinois at Urbana-Champaign
Neal E. Young
Neal E. Young University of California, Riverside
Marek Chrobak
Marek Chrobak University of California, Riverside
Rajeev Raman
Rajeev Raman University of Leicester
Prosenjit Bose
Prosenjit Bose Carleton University
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Jeffrey Scott Vitter
Jeffrey Scott Vitter University of Mississippi

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science or related fields offers flexibility and accessibility to students worldwide. You can choose from a variety of credentials, ranging from associates degrees online to advanced graduate programs that help jumpstart or advance your tech career.

For those seeking efficiency, some universities offer the quickest masters degree online options, letting you earn your credentials faster than traditional formats. If maximizing your return on investment is a priority, consider the most worthwhile masters degrees that are currently in high demand across industries.

Additionally, cost is a major consideration when evaluating further education. There are numerous affordable online colleges that make it possible to earn your degree without heavy financial strain. With the rapid growth of tech jobs, selecting any of these online degree pathways can lead to promising and versatile career options in the wider field of computer science.

Best Scientists Citing J. Ian Munro

Trending Scientists