Jump to content

Ian Munro (computer scientist)

From Wikipedia, the free encyclopedia
J. Ian Munro
Born (1947-07-10) July 10, 1947 (age 77)
Alma materUniversity of New Brunswick
University of British Columbia
University of Toronto
Known forAlgorithms and data structures
Succinct data structure
Implicit data structure
Scientific career
FieldsComputer Science
InstitutionsUniversity of Waterloo
Thesis Some Results in the Study of Algorithms  (1971)
Doctoral advisorAllan Borodin

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).

After earning a bachelor's degree in 1968 from the University of New Brunswick and a master's in 1969 from the University of British Columbia,[1] Munro finished his doctorate in 1971 from the University of Toronto, under the supervision of Allan Borodin.[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.[4]

Awards and honours

[edit]

Munro was elected as a member of the Royal Society of Canada in 2003.[5] He became an ACM Fellow in 2008 for his contributions to algorithms and data structures.[6]

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

Partial bibliography

[edit]
  • Munro, J.Ian; Suwanda, Hendra (October 1980). "Implicit data structures for fast search and update". Journal of Computer and System Sciences. 21 (2): 236–250. doi:10.1016/0022-0000(80)90037-9.

References

[edit]
  1. ^ a b Curriculum vitae, as printed in the front matter of Space-Efficient Data Structures, Streams, and Algorithms.
  2. ^ J. Ian (James) Munro at the Mathematics Genealogy Project
  3. ^ "University Professors at the University of Waterloo". 2012-02-09.
  4. ^ "Canada Research Chairs | J. Ian Munro | Canada Research Chair in Algorithm Design". Government of Canada | Canada Research Chairs. June 25, 2021. Retrieved September 22, 2021.
  5. ^ "Profile of Ian Munro". Archived from the original on 2015-09-15. Retrieved 2013-07-27.
  6. ^ "ACM Fellows Award".
  7. ^ Conference on Space Efficient Data Structures, Streams and Algorithms, August 15–16, 2013, retrieved 2013-11-04.
  8. ^ Brodnik, Andrej; López-Ortiz, Alejandro; Raman, Venkatesh; Viola, Alfredo (2013). Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Germany: Springer. ISBN 978-3-642-40272-2.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Ian_Munro_(computer_scientist)&oldid=1245483316"