Dr. J. Ian Munro
Fellow
Current Employer
University of Waterloo
Election Year
2003
Academy
Academy of Science
Discipline
Mathematics and Computer Sciences
Department
School of Computer Science
Keywords
Algorithm, efficiency, computation, data structure, analysis of algorithms
LONG
Ian Munro is a leader in the design and analysis of algorithms and data structures. He introduced implicit data structures which rearrange the source data so as to encode complex structures without need of additional storage. This led to his pioneering work in the design and analysis of succinct data structures. Derivations and generalizations to these techniques are to this date a key element in the design of state-of-the-art indexing and search algorithms for large data collections. Dr. Munro has also led the field, together with his students, in the difficult area of analysis of collision resolution strategies for hashing algorithms.
SHORT
Ian Munro is a leader in the design and analysis of algorithms and data structures. He introduced implicit data structures that rearrange the source data so as to encode complex structures without need of additional storage. Derivations and generalizations to these techniques are to this date a key element in the design of state-of-the-art indexing and search algorithms for large data collections.
Ian Munro is a leader in the design and analysis of algorithms and data structures. He introduced implicit data structures which rearrange the source data so as to encode complex structures without need of additional storage. This led to his pioneering work in the design and analysis of succinct data structures. Derivations and generalizations to these techniques are to this date a key element in the design of state-of-the-art indexing and search algorithms for large data collections. Dr. Munro has also led the field, together with his students, in the difficult area of analysis of collision resolution strategies for hashing algorithms.
SHORT
Ian Munro is a leader in the design and analysis of algorithms and data structures. He introduced implicit data structures that rearrange the source data so as to encode complex structures without need of additional storage. Derivations and generalizations to these techniques are to this date a key element in the design of state-of-the-art indexing and search algorithms for large data collections.