Ian Munro (computer scientist)
| J. Ian Munro | |
|---|---|
| Born | July 10, 1947 |
| Fields | Computer Science |
| Institutions | University of Waterloo |
| Alma mater |
University of New Brunswick University of British Columbia University of Toronto |
| Thesis | Some Results in the Study of Algorithms (1971) |
| Doctoral advisor | Allan Borodin |
| Known for |
Algorithms and data structures Succinct data structure Implicit data structure |
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]
Awards and honors
Munro was elected as a member of the Royal Society of Canada in 2003.[4] He became an ACM Fellow in 2008 for his contributions to algorithms and data structures.[5]
In 2013 a conference was held at Waterloo in his honor,[6] and a festschrift was published as its proceedings.[7]
Partial Bibliography
- 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
- 1 2 Curriculum vitae, as printed in the front matter of Space-Efficient Data Structures, Streams, and Algorithms.
- ↑ J. Ian (James) Munro at the Mathematics Genealogy Project
- ↑ "University Professors at the University of Waterloo".
- ↑ "Profile of Ian Munro".
- ↑ "ACM Fellows Award".
- ↑ Conference on Space Efficient Data Structures, Streams and Algorithms, August 15–16, 2013, retrieved 2013-11-04.
- ↑ 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.