Ian Munro (computer scientist)

Last updated
J. Ian Munro
University Professor J. Ian Munro in Waterloo, Ontario, Canada on September 1, 2021.jpg
Born (1947-07-10) July 10, 1947 (age 76)
Alma mater University of New Brunswick
University of British Columbia
University of Toronto
Known forAlgorithms and data structures
Succinct data structure
Implicit data structure
Scientific career
Fields Computer Science
Institutions University of Waterloo
Thesis Some Results in the Study of Algorithms (1971)
Doctoral advisor Allan 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).

Contents

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

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

Related Research Articles

Alfred Vaino Aho is a Canadian computer scientist best known for his work on programming languages, compilers, and related algorithms, and his textbooks on the art and science of computer programming.

<span class="mw-page-title-main">Erik Demaine</span> Professor of computer science

Erik D. Demaine is a professor of computer science at the Massachusetts Institute of Technology and a former child prodigy.

<span class="mw-page-title-main">Timothy M. Chan</span> Canadian computer scientist

Timothy Moon-Yew Chan is a Founder Professor in the Department of Computer Science at the University of Illinois at Urbana–Champaign. He was formerly Professor and University Research Chair in the David R. Cheriton School of Computer Science, University of Waterloo, Canada.

Scott J. Shenker is an American computer scientist, and professor of computer science at the University of California, Berkeley. He is also the leader of the Extensible Internet Group at the International Computer Science Institute in Berkeley, California.

<span class="mw-page-title-main">Ricardo Baeza-Yates</span>

Ricardo A. Baeza-Yates is a Chilean-Catalan computer scientist that currently is a research professor at the Institute for Experiential AI of Northeastern University in the Silicon Valley campus. He is also part-time professor at Universitat Pompeu Fabra in Barcelona and Universidad de Chile in Santiago. He is an expert member of the Global Partnership on Artificial Intelligence, a member of Spain's Advisory Council on AI, and a member of the Association for Computing Machinery's US Technology Policy Subcommittee on AI and Algorithms.

Allan Bertram Borodin is a Canadian-American computer scientist who is a professor at the University of Toronto.

<span class="mw-page-title-main">Beap</span> Data structure

A beap, or bi-parental heap, is a data structure where a node usually has two parents and two children. Unlike a heap, a beap allows sublinear search. The beap was introduced by Ian Munro and Hendra Suwanda. A related data structure is the Young tableau.

<span class="mw-page-title-main">Jeffrey Vitter</span> American computer scientist

Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi. He assumed the chancellor position on January 1, 2016. His formal investiture to the chancellorship took place on November 10, 2016, at the University of Mississippi's Oxford Campus.

Prof. Athanasios K. Tsakalidis is a Greek computer scientist, a professor at the Graphics, Multimedia and GIS Laboratory, Computer Engineering and Informatics Department (CEID), University of Patras, Greece.

In computer science, an implicit data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a data structure that requires low overhead. They are called "implicit" because the position of the elements carries meaning and relationship between elements; this is contrasted with the use of pointers to give an explicit relationship between elements. Definitions of "low overhead" vary, but generally means constant overhead; in big O notation, O(1) overhead. A less restrictive definition is a succinct data structure, which allows greater overhead.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Zvi Galil</span> Israeli mathematician and computer scientist

Zvi Galil is an Israeli-American computer scientist and mathematician. Galil served as the president of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing. His research interests include the design and analysis of algorithms, computational complexity and cryptography. He has been credited with coining the terms stringology and sparsification. He has published over 200 scientific papers and is listed as an ISI highly cited researcher.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

<span class="mw-page-title-main">Leonidas J. Guibas</span> Greek-American computer scientist

Leonidas John Guibas is the Paul Pigott Professor of Computer Science and Electrical Engineering at Stanford University. He heads the Geometric Computation group in the Computer Science Department.

<span class="mw-page-title-main">David Mount</span> American computer scientist

David Mount is a professor at the University of Maryland, College Park department of computer science whose research is in computational geometry.

Hans-Peter Kriegel is a German computer scientist and professor at the Ludwig Maximilian University of Munich and leading the Database Systems Group in the Department of Computer Science. He was previously professor at the University of Würzburg and the University of Bremen after habilitation at the Technical University of Dortmund and doctorate from Karlsruhe Institute of Technology.

Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.

<span class="mw-page-title-main">Ihab Ilyas</span> Canadian-Egyptian computer scientist (born 1973)

Ihab Francis Ilyas is a computer scientist who works in data science. He is currently a professor of computer science in the David R. Cheriton School of Computer Science at the University of Waterloo. He also leads the Knowledge Platform team at Apple Inc. Ihab is the holder of the Thomson Reuters-NSERC Industrial Research Chair in Data Cleaning at the University of Waterloo.

<span class="mw-page-title-main">Jelani Nelson</span> American computer scientist (born 1984)

Jelani Osei Nelson is an Ethiopian-American Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.

S. ("Muthu") Muthukrishnan is a computer scientist of Indian origin, known for his work in streaming algorithms, auction design, and pattern matching. He is vice president of sponsored products, Amazon (company) Advertising.

References

  1. 1 2 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.