James Ian Munro (born July 10, 1947)[1] is a Canadian computer scientist.

He is known for his fundamental contributions to algorithms and data structures (including optimal binary search trees, priority queues, hashing, and space-efficient data structures).

[2] In Munro & Suwanda (1980), he formalized the notion of an implicit data structure, and has continued work in this area.

He is currently a University Professor in the David R. Cheriton School of Computer Science at the University of Waterloo[3] and the Canada Research Chair in Algorithm Design (Tier I), a research title that was first given in 2001 and was renewed most recently in 2016.

[6] In 2013 a conference was held at Waterloo in his honor,[7] and a festschrift was published as its proceedings.